On the public citation graph
Ultimate Generalizations of LexBFS and LEX M
0 signed · 26 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-59071-4_39openalex-snapshot
On domination elimination orderings and domination graphs
inferredcites →https://doi.org/10.1007/978-3-540-30559-0_7openalex-snapshot
On the Maximum Cardinality Search Lower Bound for Treewidth
inferredcites →https://doi.org/10.1007/s00453-004-1084-3openalex-snapshot
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs
inferredcites →https://doi.org/10.1016/0022-247x(76)90182-7openalex-snapshot
Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
inferredcites →https://doi.org/10.1016/0166-218x(84)90008-8openalex-snapshot
Some aspects of perfect elimination orderings in chordal graphs
inferredcites →https://doi.org/10.1016/s0166-218x(98)00005-5openalex-snapshot
Separability generalizes Dirac's theorem
inferredcites →https://doi.org/10.1016/s0304-3975(99)00126-7openalex-snapshot
A practical algorithm for making filled graphs minimal
inferredcites →https://doi.org/10.1016/s1571-0653(05)80065-4openalex-snapshot
Moplex elimination orderings
inferredcites →https://doi.org/10.1137/0205012openalex-snapshot
A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a Graph
inferredcites →https://doi.org/10.1137/0205013openalex-snapshot
On the Number of Additions to Compute Specific Polynomials
inferredcites →https://doi.org/10.1137/0205021openalex-snapshot
Algorithmic Aspects of Vertex Elimination on 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/s0097539795282377openalex-snapshot
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
inferredcites →https://doi.org/10.2140/pjm.1965.15.835openalex-snapshot
Incidence matrices and 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/978-3-642-11476-2_20openalex-snapshot
Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2010.02.011openalex-snapshot
A General Label Search to investigate classical graph search algorithms
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.061openalex-snapshot
Simple vertex ordering characterizations for graph search
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.066openalex-snapshot
Extremities and orderings defined by generalized graph search algorithms
inferred← citeshttps://doi.org/10.1016/j.ic.2009.03.008openalex-snapshot
Treewidth computations I. Upper bounds
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.006openalex-snapshot
Distributed computing of efficient routing schemes in generalized chordal graphs
inferred← citeshttps://doi.org/10.1137/070684355openalex-snapshot
Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings
inferred← citeshttps://doi.org/10.1145/2851141.2851161openalex-snapshot
Multi-core on-the-fly SCC decomposition
inferred← citeshttps://doi.org/10.1145/3016078.2851161openalex-snapshot
Multi-core on-the-fly SCC decomposition
inferred← citeshttps://doi.org/10.3990/1.9789036547864openalex-snapshot
Strong connectivity and shortest paths for checking models
inferred← citeshttps://doi.org/10.5335/rbca.v8i2.5602openalex-snapshot
Extensões e caracterizações de buscas para hipergrafos com arestas múltiplas
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.