On the public citation graph

Parallel algorithms for treewidth two

https://doi.org/10.1007/bfb0024496
0 signed · 28 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.1006/jagm.1996.0002openalex-snapshot
Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
inferredcites →https://doi.org/10.1007/3-540-50728-0_32openalex-snapshot
NC-algorithms for graphs with small treewidth
inferredcites →https://doi.org/10.1007/3-540-60084-1_80openalex-snapshot
Parallel algorithms with optimal speedup for bounded treewidth
inferredcites →https://doi.org/10.1007/3-540-61332-3_153openalex-snapshot
Reduction algorithms for constructing solutions in graphs with small treewidth
inferredcites →https://doi.org/10.1007/3-540-61680-2_62openalex-snapshot
Parallel algorithms for series parallel graphs
inferredcites →https://doi.org/10.1016/0022-247x(65)90125-3openalex-snapshot
Topology of series-parallel networks
inferredcites →https://doi.org/10.1016/0196-6774(86)90023-4openalex-snapshot
Graph minors. II. Algorithmic aspects of tree-width
inferredcites →https://doi.org/10.1016/0196-6774(89)90017-5openalex-snapshot
A simple parallel tree contraction algorithm
inferredcites →https://doi.org/10.1016/0196-6774(91)90006-kopenalex-snapshot
Easy problems for tree-decomposable graphs
inferredcites →https://doi.org/10.1016/0196-6774(91)90020-yopenalex-snapshot
Algorithms finding tree-decompositions of graphs
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.1016/0890-5401(92)90041-dopenalex-snapshot
Parallel recognition of series-parallel graphs
inferredcites →https://doi.org/10.1137/0404031openalex-snapshot
NC Algorithms for Recognizing Partial 2-Trees and 3-Trees
inferredcites →https://doi.org/10.1137/0607033openalex-snapshot
Characterization and Recognition of Partial 3-Trees
inferredcites →https://doi.org/10.1137/s0097539793251219openalex-snapshot
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
inferredcites →https://doi.org/10.1137/s0097539795289859openalex-snapshot
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
inferredcites →https://doi.org/10.1137/s0895480193243043openalex-snapshot
On Linear Recognition of Tree-Width at Most Four
inferredcites →https://doi.org/10.1145/174147.169807openalex-snapshot
An algebraic theory of graph reduction

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118567869.ch21openalex-snapshot
Efficient Alignments of Metabolic Networks with Bounded Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-030-42071-0openalex-snapshot
Treewidth, Kernels, and Algorithms
inferred← citeshttps://doi.org/10.1007/bfb0028578openalex-snapshot
Minimum spanning trees for minor-closed graph classes in parallel
inferred← citeshttps://doi.org/10.1007/bfb0029946openalex-snapshot
Treewidth: Algorithmic techniques and results
inferred← citeshttps://doi.org/10.1007/s00453-007-9131-5openalex-snapshot
I/O-Efficient Algorithms for Graphs of Bounded Treewidth
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00175-xopenalex-snapshot
Algorithms and obstructions for linear-width and related search parameters
inferred← citeshttps://doi.org/10.1109/icdmw.2010.150openalex-snapshot
Efficient Alignments of Metabolic Networks with Bounded Treewidth
inferred← citeshttps://doi.org/10.1137/s0097539795289859openalex-snapshot
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
inferred← citeshttps://doi.org/10.5555/365411.365423openalex-snapshot
I/O-efficient algorithms for graphs of bounded treewidth
inferred← citeshttps://doi.org/10.57709/1223653openalex-snapshot
Metabolic Network Alignments and their Applications
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.