On the public citation graph

The correlation between the complexities of the non-hierarchical and hierarchical versions of graph problems

https://doi.org/10.1007/bfb0039598
0 signed · 36 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-16078-7_73openalex-snapshot
Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs
inferredcites →https://doi.org/10.1007/3-540-16761-7_71openalex-snapshot
Hierarchical planarity testing algorithms
inferredcites →https://doi.org/10.1007/3-540-16766-8_16openalex-snapshot
Exploiting hierarchy in VLSI design
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/bf00289117openalex-snapshot
The complexity of combinatorial problems with succinct input representation
inferredcites →https://doi.org/10.1007/bfb0030338openalex-snapshot
The complexity of problems concerning graphs with regularities
inferredcites →https://doi.org/10.1016/0304-3975(82)90092-5openalex-snapshot
The maximum flow problem is log space complete for P
inferredcites →https://doi.org/10.1016/s0019-9958(83)80004-7openalex-snapshot
Succinct representations of graphs
inferredcites →https://doi.org/10.1016/s0019-9958(86)80009-2openalex-snapshot
A note on succinct representations of graphs
inferredcites →https://doi.org/10.1016/s0022-0000(73)80031-5openalex-snapshot
Maze recognizing automata and nondeterministic tape complexity
inferredcites →https://doi.org/10.1109/sfcs.1979.21openalex-snapshot
Length of predicate calculus formulas as a new complexity measure
inferredcites →https://doi.org/10.1109/sfcs.1981.3openalex-snapshot
A complexity theory based on Boolean algebra
inferredcites →https://doi.org/10.1109/sfcs.1982.92openalex-snapshot
The complexity of compacting hierarchically specified layouts of integrated circuits
inferredcites →https://doi.org/10.1109/swat.1972.29openalex-snapshot
The equivalence problem for regular expressions with squaring requires exponential space
inferredcites →https://doi.org/10.1109/swat.1973.20openalex-snapshot
On tape-bounded complexity classes and multi-head finite automata
inferredcites →https://doi.org/10.1145/1008354.1008356openalex-snapshot
The monotone and planar circuit value problems are log space complete for P
inferredcites →https://doi.org/10.1145/3149.3158openalex-snapshot
A complexity theory based on Boolean algebra
inferredcites →https://doi.org/10.1145/800125.804029openalex-snapshot
Word problems requiring exponential time(Preliminary Report)
inferredcites →https://doi.org/10.3139/9783446472563.fmopenalex-snapshot
Theoretische Informatik

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/0-306-48332-7_61openalex-snapshot
Complexity Classes in Optimization
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_101openalex-snapshot
On matroids and hierarchical graphs
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_63openalex-snapshot
The complexity of approximating PSPACE-complete problems for hierarchical specifications
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_38openalex-snapshot
Hierarchically specified unit disk graphs
inferred← citeshttps://doi.org/10.1007/978-1-4020-9688-4_8openalex-snapshot
The Complexity of Processing Hierarchical Specifications
inferred← citeshttps://doi.org/10.1007/978-3-642-58117-5_15openalex-snapshot
On Synchronized Lindenmayer Picture Languages
inferred← citeshttps://doi.org/10.1007/bf01928922openalex-snapshot
The computational complexity of graph problems with succinct multigraph representation
inferred← citeshttps://doi.org/10.1007/bfb0017422openalex-snapshot
Computing by graph transformation: Overall aims and new results
inferred← citeshttps://doi.org/10.1007/bfb0035868openalex-snapshot
PLEXUS: A system for implementing hierarchical graph algorithms
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90232-7openalex-snapshot
On matroids and hierarchial graphs
inferred← citeshttps://doi.org/10.1016/0196-6774(87)90042-3openalex-snapshot
Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90101-mopenalex-snapshot
The binary network flow problem is logspace complete for P
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50015-1openalex-snapshot
Graph Algorithms
inferred← citeshttps://doi.org/10.1109/sct.1994.315789openalex-snapshot
Generalized CNF satisfiability problems and non-efficient approximability
inferred← citeshttps://doi.org/10.1137/0217068openalex-snapshot
Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs
inferred← citeshttps://doi.org/10.1137/0222042openalex-snapshot
The Complexity of Processing Hierarchical Specifications
inferred← citeshttps://doi.org/10.1145/165231.165255openalex-snapshot
An implementation of the ε-relaxation algorithm on the CM-5
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.