On the public citation graph
Parallel Algorithms in Graph Theory: Planarity Testing
0 signed · 100 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1016/0020-0190(78)90079-0openalex-snapshot
An improved parallel processor bound in fast matrix inversion
inferredcites →https://doi.org/10.1016/s0022-0000(76)80037-2openalex-snapshot
A characterization of the power of vector machines
inferredcites →https://doi.org/10.1016/s0022-0000(76)80045-1openalex-snapshot
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
inferredcites →https://doi.org/10.1109/proc.1966.5273openalex-snapshot
Very high-speed computing systems
inferredcites →https://doi.org/10.1109/swat.1974.20openalex-snapshot
On the power of multiplication in random access machines
inferredcites →https://doi.org/10.1137/0205040openalex-snapshot
Fast Parallel Matrix Inversion Algorithms
inferredcites →https://doi.org/10.1137/0210051openalex-snapshot
Fast, Efficient Parallel Algorithms for Some Graph Problems
inferredcites →https://doi.org/10.1137/1020096openalex-snapshot
A Survey of Parallel Algorithms in Numerical Linear Algebra
inferredcites →https://doi.org/10.1145/321812.321815openalex-snapshot
The Parallel Evaluation of General Arithmetic Expressions
inferredcites →https://doi.org/10.1145/800113.803631openalex-snapshot
Parallel algorithms for the transitive closure and the connected component problems
inferredcites →https://doi.org/10.1145/800133.804336openalex-snapshot
A unified approach to models of synchronous parallel machines
inferredcites →https://doi.org/10.1145/800133.804339openalex-snapshot
Parallelism in random access machines
inferredcites →https://doi.org/10.1215/s0012-7094-37-00305-3openalex-snapshot
On the maps of an n-sphere into another n-sphere
inferredcites →https://doi.org/10.4064/fm-28-1-22-32openalex-snapshot
A combinatorial condition for planar graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1998.0943openalex-snapshot
A Randomized Parallel Algorithm for Planar Graph Isomorphism
inferred← citeshttps://doi.org/10.1006/jcss.1998.1597openalex-snapshot
Topological Queries in Spatial Databases
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1495openalex-snapshot
Orthogonally Drawing Cubic Graphs in Parallel
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_95openalex-snapshot
The classification of problems which have fast parallel algorithms
inferred← citeshttps://doi.org/10.1007/3-540-16766-8_4openalex-snapshot
Parallel ear decomposition search (EDS) and st-numbering in graphs
inferred← citeshttps://doi.org/10.1007/3-540-18740-5_36openalex-snapshot
Fast parallel algorithms for optimal edge-colouring of some tree-structured graphs
inferred← citeshttps://doi.org/10.1007/3-540-19487-8_27openalex-snapshot
NC algorithms for computing the number of perfect matchings in K 3,3-free graphs and related problems
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_7openalex-snapshot
The Complexity of Planarity Testing
inferred← citeshttps://doi.org/10.1007/3-540-50647-0_110openalex-snapshot
Fast parallel algorithms and the complexity of parallelism (basic issues and recent advances)
inferred← citeshttps://doi.org/10.1007/3-540-54029-6_194openalex-snapshot
A simple optimal parallel algorithm to solve the lowest common ancestor problem
inferred← citeshttps://doi.org/10.1007/3-540-58218-5_28openalex-snapshot
Parallel dynamic lowest common ancestors
inferred← citeshttps://doi.org/10.1007/978-3-319-58631-1_9openalex-snapshot
On the Computational Complexity of the Freezing Non-strict Majority Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-99813-8_37openalex-snapshot
Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-20877-5_52openalex-snapshot
Planarity Testing Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-76070-9_21openalex-snapshot
Some Remarks on Emotion, Cognition, and Connectionist Systems
inferred← citeshttps://doi.org/10.1007/bf00264160openalex-snapshot
Space efficient algorithms for some graph theoretical problems
inferred← citeshttps://doi.org/10.1007/bf01189069openalex-snapshot
An efficient parallel algorithm for finding rectangular duals of plane triangular graphs
inferred← citeshttps://doi.org/10.1007/bf01191205openalex-snapshot
A new graph triconnectivity algorithm and its parallelization
inferred← citeshttps://doi.org/10.1007/bf01937481openalex-snapshot
A parallel search algorithm for directed acyclic graphs
inferred← citeshttps://doi.org/10.1007/bfb0016262openalex-snapshot
Some improved parallelisms for graphs
inferred← citeshttps://doi.org/10.1007/bfb0022491openalex-snapshot
Mathematical Foundations of Computer Science 1980
inferred← citeshttps://doi.org/10.1007/bfb0035771openalex-snapshot
Finding triconnected components by local replacements
inferred← citeshttps://doi.org/10.1016/0020-0190(82)90093-xopenalex-snapshot
Parallel computation and conflicts in memory access
inferred← citeshttps://doi.org/10.1016/0020-0190(84)90072-3openalex-snapshot
Parallel strong orientation of an undirected graph
inferred← citeshttps://doi.org/10.1016/0020-0190(85)90024-9openalex-snapshot
Depth-first search is inherently sequential
inferred← citeshttps://doi.org/10.1016/0020-0190(85)90036-5openalex-snapshot
A note on finding minimum cuts in directed planar networks by parallel computations
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90069-5openalex-snapshot
A simple parallel algorithm for finding a satisfying truth assignment to a 2-cnf formula
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90080-4openalex-snapshot
Parallel O(log n) time edge-colouring of trees and Halin graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90082-sopenalex-snapshot
Fast algorithms for lowest common ancestors on a processor array with reconfigurable buses
inferred← citeshttps://doi.org/10.1016/0022-0000(86)90030-9openalex-snapshot
Finding small simple cycle separators for 2-connected planar graphs
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90006-2openalex-snapshot
An efficient parallel algorithm for planarity
inferred← citeshttps://doi.org/10.1016/0167-8191(92)90086-mopenalex-snapshot
A fast cost-optimal parallel algorithm for the lowest common ancestor problem
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90153-2openalex-snapshot
Parallel ear decomposition search (EDS) and st-numbering in graphs
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90017-5openalex-snapshot
NC algorithms for computing the number of perfect matchings in K3,3-free graphs and related problems
inferred← citeshttps://doi.org/10.1016/0925-7721(94)00014-xopenalex-snapshot
Algorithms for drawing graphs: an annotated bibliography
inferred← citeshttps://doi.org/10.1016/b978-0-12-084320-6.50011-6openalex-snapshot
Computing with Connections
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50022-9openalex-snapshot
Parallel Algorithms for Shared-Memory Machines
inferred← citeshttps://doi.org/10.1016/j.camwa.2007.07.002openalex-snapshot
Formula dissection: A parallel algorithm for constraint satisfaction
inferred← citeshttps://doi.org/10.1016/j.ic.2003.09.002openalex-snapshot
The complexity of planarity testing
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104535openalex-snapshot
On the complexity of the stability problem of binary freezing totalistic cellular automata
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.04.002openalex-snapshot
Parallel recognition algorithms for chordal_planar graphs and planar k -trees
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80041-3openalex-snapshot
A taxonomy of problems with fast parallel algorithms
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80070-4openalex-snapshot
Planarity testing in parallel
inferred← citeshttps://doi.org/10.1016/s0065-2458(08)60006-6openalex-snapshot
Parallel Algorithms for Some Computational Problems
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73240-7openalex-snapshot
Parallel Computer Models and Combinatorial Algorithms
inferred← citeshttps://doi.org/10.1016/s0364-0213(82)80001-3openalex-snapshot
Connectionist Models and Their Properties
inferred← citeshttps://doi.org/10.1109/31.1743openalex-snapshot
Parallel algorithms for planar graph isomorphism and related problems
inferred← citeshttps://doi.org/10.1109/71.888641openalex-snapshot
A simple parallel algorithm to draw cubic graphs
inferred← citeshttps://doi.org/10.1109/afips.1985.42openalex-snapshot
Parallel Algorithms for Bridge- and Bi-Connectivity on Minimum Area Meshes
inferred← citeshttps://doi.org/10.1109/sfcs.1981.3openalex-snapshot
A complexity theory based on Boolean algebra
inferred← citeshttps://doi.org/10.1109/sfcs.1982.83openalex-snapshot
Parallel algorithms for minimum cuts and maximum flows in planar networks
inferred← citeshttps://doi.org/10.1109/sfcs.1982.84openalex-snapshot
Parallel time O(log N) acceptance of deterministic CFLs
inferred← citeshttps://doi.org/10.1109/sfcs.1985.43openalex-snapshot
Parallel tree contraction and its application
inferred← citeshttps://doi.org/10.1109/sfcs.1986.6openalex-snapshot
An efficient parallel algorithm for planarity
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63491openalex-snapshot
An optimal parallel algorithm for graph planarity
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63493openalex-snapshot
The parallel complexity of the subgraph connectivity problem
inferred← citeshttps://doi.org/10.1109/tc.1983.1676171openalex-snapshot
Optimal Parallel Scheduling of Gaussian Elimination DAG's
inferred← citeshttps://doi.org/10.1109/tc.1986.1676830openalex-snapshot
Finding Lowest Common Ancestors in Parallel
inferred← citeshttps://doi.org/10.1111/j.1467-8659.1985.tb00237.xopenalex-snapshot
An Edge‐Face Relational Scheme for Boundary Representations
inferred← citeshttps://doi.org/10.1137/0213036openalex-snapshot
Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
inferred← citeshttps://doi.org/10.1137/0215058openalex-snapshot
Parallel Algorithms for Depth-First Searches I. Planar Graphs
inferred← citeshttps://doi.org/10.1137/0220045openalex-snapshot
Parallel Transitive Closure and Point Location in Planar Structures
inferred← citeshttps://doi.org/10.1137/0220070openalex-snapshot
Parallel Tree Contraction Part 2: Further Applications
inferred← citeshttps://doi.org/10.1137/0222039openalex-snapshot
Parallel Complexity of the Connected Subgraph Problem
inferred← citeshttps://doi.org/10.1137/0222040openalex-snapshot
Finding Triconnected Components by Local Replacement
inferred← citeshttps://doi.org/10.1137/19m1256221openalex-snapshot
NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs
inferred← citeshttps://doi.org/10.1145/28395.28431openalex-snapshot
A new graphy triconnectivity algorithm and its parallelization
inferred← citeshttps://doi.org/10.1145/3149.3158openalex-snapshot
A complexity theory based on Boolean algebra
inferred← citeshttps://doi.org/10.1145/322374.322382openalex-snapshot
An Efficient General-Purpose Parallel Computer
inferred← citeshttps://doi.org/10.1145/3323165.3323206openalex-snapshot
NC Algorithms for Computing a Perfect Matching, the Number of Perfect Matchings, and a Maximum Flow in One-Crossing-Minor-Free Graphs
inferred← citeshttps://doi.org/10.1145/72935.72978openalex-snapshot
Optimal parallel algorithms for transitive closure and point location in planar structures
inferred← citeshttps://doi.org/10.1145/800076.802478openalex-snapshot
An efficient general purpose parallel computer
inferred← citeshttps://doi.org/10.21236/ada108823openalex-snapshot
Symmetric Complementation. Revision
inferred← citeshttps://doi.org/10.48550/arxiv.0709.0748openalex-snapshot
On P vs. NP, Geometric Complexity Theory, and the Flip I: a high level view
inferred← citeshttps://doi.org/10.48550/arxiv.1408.3977openalex-snapshot
Spanning Tree Enumeration in 2-trees: Sequential and Parallel Perspective
inferred← citeshttps://doi.org/10.70675/71cb115fz686ez49d4zb0e9z72dd52c70a14openalex-snapshot
Universalité et complexité des automates cellulaires coagulants
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.