On the public citation graph
Canonical representations of partial 2- and 3-trees
0 signed · 37 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.1002/net.3230130202openalex-snapshot
Steiner trees, partial 2–trees, and minimum IFI networks
inferredcites →https://doi.org/10.1007/3-540-12689-9_114openalex-snapshot
Isomorphism testing and canonical forms for k-contractable graphs (A generalization of bounded valence and bounded genus)
inferredcites →https://doi.org/10.1007/3-540-19487-8_26openalex-snapshot
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/bf01934985openalex-snapshot
Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
inferredcites →https://doi.org/10.1016/0012-365x(74)90042-9openalex-snapshot
On simple characterizations of k-trees
inferredcites →https://doi.org/10.1016/0012-365x(84)90164-xopenalex-snapshot
Separating subgraphs in k-trees: Cables and caterpillars
inferredcites →https://doi.org/10.1016/0020-0190(79)90114-5openalex-snapshot
A fast equivalence-checking algorithm for circular lists
inferredcites →https://doi.org/10.1016/0020-0190(80)90149-0openalex-snapshot
Lexicographically least circular substrings
inferredcites →https://doi.org/10.1016/0022-0000(82)90009-5openalex-snapshot
Isomorphism of graphs of bounded valence can be tested in polynomial time
inferredcites →https://doi.org/10.1016/0022-247x(70)90282-9openalex-snapshot
Triangulated graphs and the elimination process
inferredcites →https://doi.org/10.1016/0095-8956(86)90030-4openalex-snapshot
Graph minors. V. Excluding a planar graph
inferredcites →https://doi.org/10.1016/0166-218x(89)90031-0openalex-snapshot
Linear time algorithms for NP-hard problems restricted to partial k-trees
inferredcites →https://doi.org/10.1016/0890-5401(90)90043-hopenalex-snapshot
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
inferredcites →https://doi.org/10.1109/fscs.1990.89536openalex-snapshot
Efficient parallel algorithms for tree-decomposition and related problems
inferredcites →https://doi.org/10.1137/0210015openalex-snapshot
Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
inferredcites →https://doi.org/10.1137/0210028openalex-snapshot
Recursive Graphs, Recursive Labelings and Shortest Paths
inferredcites →https://doi.org/10.1137/0607033openalex-snapshot
Characterization and Recognition of Partial 3-Trees
inferredcites →https://doi.org/10.1137/0608024openalex-snapshot
Complexity of Finding Embeddings in a k -Tree
inferredcites →https://doi.org/10.1145/174147.169807openalex-snapshot
An algebraic theory of graph reduction
inferredcites →https://doi.org/10.1145/800119.803896openalex-snapshot
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)
inferredcites →https://doi.org/10.1145/800141.804670openalex-snapshot
Isomorphism testing for graphs of bounded genus
inferredcites →https://doi.org/10.1145/800141.804671openalex-snapshot
A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_106openalex-snapshot
A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_71openalex-snapshot
The Space Complexity of k-Tree Isomorphism
inferred← citeshttps://doi.org/10.1007/978-3-540-79709-8_8openalex-snapshot
A Logspace Algorithm for Partial 2-Tree Canonization
inferred← citeshttps://doi.org/10.1007/978-3-642-40988-2_40openalex-snapshot
Efficient Frequent Connected Induced Subgraph Mining in Graphs of Bounded Tree-Width
inferred← citeshttps://doi.org/10.1007/bfb0029946openalex-snapshot
Treewidth: Algorithmic techniques and results
inferred← citeshttps://doi.org/10.1007/s00453-001-0052-4openalex-snapshot
Fast Parallel Reordering and Isomorphism Testing of k -Trees
inferred← citeshttps://doi.org/10.1007/s11786-011-0078-1openalex-snapshot
Visibility Drawings of Plane 3-Trees with Minimum Area
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.03.030openalex-snapshot
Efficient frequent connected subgraph mining in graphs of bounded tree-width
inferred← citeshttps://doi.org/10.1109/focs.2014.28openalex-snapshot
Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
inferred← citeshttps://doi.org/10.1137/140999980openalex-snapshot
Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
inferred← citeshttps://doi.org/10.14257/ijgdc.2016.9.5.21openalex-snapshot
Apply Partition Tree to Compute Canonical Labelings of Graphs
inferred← citeshttps://doi.org/10.3390/sym16121638openalex-snapshot
Practical Canonical Labeling of Multi-Digraphs via Computer Algebra
inferred← citeshttps://doi.org/10.48550/arxiv.1404.0818openalex-snapshot
Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth
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.