On the public citation graph
Finding minimum height elimination trees for interval graphs in polynomial time
0 signed · 55 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/3-540-57785-8_187openalex-snapshot
On vertex ranking for permutation and other graphs
inferredcites →https://doi.org/10.1007/978-1-4613-8369-7openalex-snapshot
Graph Theory and Sparse Matrix Computation
inferredcites →https://doi.org/10.1007/978-1-4613-8369-7_1openalex-snapshot
An Introduction to Chordal Graphs and Clique Trees
inferredcites →https://doi.org/10.1016/0020-0190(89)90070-7openalex-snapshot
Counting clique trees and computing perfect elimination schemes in parallel
inferredcites →https://doi.org/10.1016/0095-8956(74)90094-xopenalex-snapshot
The intersection graphs of subtrees in trees are exactly the chordal graphs
inferredcites →https://doi.org/10.1016/b978-0-12-141050-6.50006-4openalex-snapshot
GRAPH THEORY AND GAUSSIAN ELIMINATION
inferredcites →https://doi.org/10.1016/b978-1-4832-3187-7.50018-0openalex-snapshot
A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS
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.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1137/0213035openalex-snapshot
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
inferredcites →https://doi.org/10.1137/0602010openalex-snapshot
Computing the Minimum Fill-In is NP-Complete
inferredcites →https://doi.org/10.1137/0611010openalex-snapshot
The Role of Elimination Trees in Sparse Factorization
inferredcites →https://doi.org/10.1145/800195.805928openalex-snapshot
Reducing the bandwidth of sparse symmetric matrices
inferredcites →https://doi.org/10.2140/pjm.1965.15.835openalex-snapshot
Incidence matrices and interval graphs
inferredcites →https://doi.org/10.2172/5217041openalex-snapshot
On finding minimum-diameter clique trees
inferredcites →https://doi.org/10.4153/cjm-1964-055-5openalex-snapshot
A Characterization of Comparability Graphs and of Interval Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11604686_32openalex-snapshot
Computation of Chromatic Polynomials Using Triangulations and Clique Trees
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_187openalex-snapshot
On vertex ranking for permutation and other graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-86838-3_13openalex-snapshot
A Heuristic Approach to the Treedepth Decomposition Problem for Large Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-11266-9_64openalex-snapshot
Vertex Ranking with Capacity
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_9openalex-snapshot
Search-Space Size in Contraction Hierarchies
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_77openalex-snapshot
A Faster Parameterized Algorithm for Treedepth
inferred← citeshttps://doi.org/10.1007/bfb0009493openalex-snapshot
Vertex ranking of asteroidal triple-free graphs
inferred← citeshttps://doi.org/10.1007/s10878-024-01249-0openalex-snapshot
Optimal blocks for maximizing the transaction fee revenue of Bitcoin miners
inferred← citeshttps://doi.org/10.1016/j.dam.2012.10.012openalex-snapshot
Finding the edge ranking number through vertex partitions
inferred← citeshttps://doi.org/10.1016/j.ic.2008.08.001openalex-snapshot
Optimal vertex ranking of block graphs
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104867openalex-snapshot
Compact representation of graphs with bounded bandwidth or treedepth
inferred← citeshttps://doi.org/10.1016/j.ins.2007.02.002openalex-snapshot
Constructing a minimum height elimination tree of a tree in linear time
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.12.006openalex-snapshot
Vertex rankings of chordal graphs and weighted trees
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.03.014openalex-snapshot
A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00162-8openalex-snapshot
Vertex ranking of asteroidal triple-free graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00179-1openalex-snapshot
On the vertex ranking problem for trapezoid, circular-arc and other graphs
inferred← citeshttps://doi.org/10.1023/a:1022032830105openalex-snapshot
Finding Optimal Ordering of Sparse Matrices for Column-Oriented Parallel Cholesky Factorization
inferred← citeshttps://doi.org/10.1109/dcc47342.2020.00031openalex-snapshot
Compact Representation of Graphs with Small Bandwidth and Treedepth
inferred← citeshttps://doi.org/10.1109/ipdps.2000.846067openalex-snapshot
On optimal fill-preserving orderings of sparse matrices for parallel Cholesky factorizations
inferred← citeshttps://doi.org/10.1137/1.9781611977073.84openalex-snapshot
Efficient generation of elimination trees and graph associahedra
inferred← citeshttps://doi.org/10.1137/s0895479803386354openalex-snapshot
On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations
inferred← citeshttps://doi.org/10.1145/305619.305640openalex-snapshot
Tradeoffs between parallelism and fill in nested dissection
inferred← citeshttps://doi.org/10.1145/3595180openalex-snapshot
Competitive Online Search Trees on Trees
inferred← citeshttps://doi.org/10.1145/3689633openalex-snapshot
Combinatorial Generation via Permutation Languages. IV. Elimination Trees
inferred← citeshttps://doi.org/10.4230/lipics.sea.2020.19openalex-snapshot
An Algorithm for the Exact Treedepth Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1401.7540openalex-snapshot
A Faster Parameterized Algorithm for Treedepth
inferred← citeshttps://doi.org/10.7151/dmgt.1309openalex-snapshot
Optimal edge ranking of complete bipartite graphs in polynomial time
inferred← citeshttps://doi.org/10.7155/jgaa.00293openalex-snapshot
Maximal Neighborhood Search and Rigid Interval Graphs
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.