On the public citation graph

Influence of the tie-break rule on the end-vertex problem

0 signed · 29 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.1007/bf02837777openalex-snapshot
Introduction to algorithms
inferredcites →https://doi.org/10.1016/0012-365x(95)00057-4openalex-snapshot
Hamiltonian circuits in chordal bipartite graphs
inferredcites →https://doi.org/10.1016/0020-0190(86)90135-3openalex-snapshot
Hamiltonian circuits in interval graph generalizations
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/j.dam.2009.10.001openalex-snapshot
On end-vertices of Lexicographic Breadth First Searches
inferredcites →https://doi.org/10.1016/j.dam.2013.02.028openalex-snapshot
Moplex orderings generated by the LexDFS algorithm
inferredcites →https://doi.org/10.1016/j.dam.2015.07.016openalex-snapshot
A new LBFS-based algorithm for cocomparability graph recognition
inferredcites →https://doi.org/10.1016/j.disc.2014.12.014openalex-snapshot
Vertex elimination orderings for hereditary graph classes
inferredcites →https://doi.org/10.1016/j.tcs.2012.09.018openalex-snapshot
On computing the diameter of real-world undirected graphs
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0304-3975(97)00241-7openalex-snapshot
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
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/0218005openalex-snapshot
An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
inferredcites →https://doi.org/10.1137/050623498openalex-snapshot
A Unified View of Graph Searching
inferredcites →https://doi.org/10.1145/362248.362272openalex-snapshot
Algorithm 447: efficient algorithms for graph manipulation
inferredcites →https://doi.org/10.1145/800119.803884openalex-snapshot
Some simplified NP-complete problems
inferredcites →https://doi.org/10.3390/a3020100openalex-snapshot
Graph Extremities Defined by Search Algorithms

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-58150-3_5openalex-snapshot
End-Vertices of AT-free Bigraphs
inferred← citeshttps://doi.org/10.1007/978-3-031-15914-5_31openalex-snapshot
Linearizing Partial Search Orders
inferred← citeshttps://doi.org/10.1007/978-3-031-43380-1_33openalex-snapshot
Graph Search Trees and Their Leaves
inferred← citeshttps://doi.org/10.1007/978-3-319-18173-8_22openalex-snapshot
End-Vertices of Graph Search Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-022-00981-5openalex-snapshot
Graph Searches and Their End Vertices
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.ipl.2021.106176openalex-snapshot
End vertices of graph searches on bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.09.018openalex-snapshot
On the recognition of search trees generated by BFS and DFS
inferred← citeshttps://doi.org/10.1145/3711844openalex-snapshot
Computing Hamiltonian Paths with Partial Order Restrictions
inferred← citeshttps://doi.org/10.23638/dmtcs-21-1-13openalex-snapshot
On the End-Vertex Problem of Graph Searches
inferred← citeshttps://doi.org/10.26493/1855-3974.3238.2a8openalex-snapshot
On the leaves of graph search trees
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.