On the public citation graph
Graph Extremities Defined by Search Algorithms
0 signed · 42 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-1-4613-8369-7_1openalex-snapshot
An Introduction to Chordal Graphs and Clique Trees
inferredcites →https://doi.org/10.1007/978-3-540-24587-2_7openalex-snapshot
A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs
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(70)90282-9openalex-snapshot
Triangulated graphs and the elimination process
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/j.endm.2005.06.066openalex-snapshot
Extremities and orderings defined by generalized graph search algorithms
inferredcites →https://doi.org/10.1016/j.jalgor.2004.07.001openalex-snapshot
A wide-range algorithm for minimal triangulation from an arbitrary ordering
inferredcites →https://doi.org/10.1016/s0012-365x(96)00070-2openalex-snapshot
LexBFS-orderings and powers of 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/s0166-218x(99)00157-2openalex-snapshot
LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s1571-0653(05)80065-4openalex-snapshot
Moplex elimination orderings
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/070684355openalex-snapshot
Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings
inferredcites →https://doi.org/10.1137/s0097539795282377openalex-snapshot
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
inferredcites →https://doi.org/10.1137/s0895480193250125openalex-snapshot
Asteroidal Triple-Free Graphs
inferredcites →https://doi.org/10.2140/pjm.1965.15.835openalex-snapshot
Incidence matrices and interval graphs
inferredcites →https://doi.org/10.4064/fm-51-1-45-64openalex-snapshot
Representation of a finite graph by a set of intervals on the real line
inferredcites →https://doi.org/10.5555/338219.338231openalex-snapshot
Weakly chordal graph algorithms via handles
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-030-24766-9_10openalex-snapshot
Avoidable Vertices and Edges in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_5openalex-snapshot
End-Vertices of AT-free Bigraphs
inferred← citeshttps://doi.org/10.1007/978-3-031-20624-5_7openalex-snapshot
Computing and Listing Avoidable Vertices and Paths
inferred← citeshttps://doi.org/10.1007/s00025-025-02421-6openalex-snapshot
Growing Trees and Amoebas’ Replications
inferred← citeshttps://doi.org/10.1007/s00453-022-00981-5openalex-snapshot
Graph Searches and Their End Vertices
inferred← citeshttps://doi.org/10.1007/s00453-023-01168-2openalex-snapshot
Computing and Listing Avoidable Vertices and Paths
inferred← citeshttps://doi.org/10.1016/j.dam.2013.02.028openalex-snapshot
Moplex orderings generated by the LexDFS algorithm
inferred← citeshttps://doi.org/10.1016/j.dam.2014.05.030openalex-snapshot
Organizing the atoms of the clique separator decomposition into an atom tree
inferred← citeshttps://doi.org/10.1016/j.dam.2014.11.018openalex-snapshot
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
inferred← citeshttps://doi.org/10.1016/j.dam.2017.02.027openalex-snapshot
End-vertices of LBFS of (AT-free) bigraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.12.006openalex-snapshot
Avoidable vertices and edges in graphs: Existence, characterization, and applications
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.02.013openalex-snapshot
A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
inferred← citeshttps://doi.org/10.1016/j.jctb.2024.03.005openalex-snapshot
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure
inferred← citeshttps://doi.org/10.23638/dmtcs-21-1-13openalex-snapshot
On the End-Vertex Problem of Graph Searches
inferred← citeshttps://doi.org/10.3390/a10010020openalex-snapshot
Computing a Clique Tree with the Algorithm Maximal Label Search
inferred← citeshttps://doi.org/10.46298/dmtcs.2081openalex-snapshot
Influence of the tie-break rule on the end-vertex problem
inferred← citeshttps://doi.org/10.48550/arxiv.1610.09623openalex-snapshot
Computing a clique tree with algorithm MLS (Maximal Label Search)
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.