On the public citation graph
A four-sweep LBFS recognition algorithm for interval graphs
0 signed · 54 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.1002/jgt.3190200312openalex-snapshot
Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs
inferredcites →https://doi.org/10.1007/3-540-44867-5_16openalex-snapshot
A Clustering Algorithm for Interval Graph Test on Noisy Data
inferredcites →https://doi.org/10.1007/3-540-54891-2_22openalex-snapshot
A new simple linear algorithm to recognize interval graphs
inferredcites →https://doi.org/10.1007/3-540-56402-0_31openalex-snapshot
A simple test for interval graphs
inferredcites →https://doi.org/10.1007/3-540-61576-8_70openalex-snapshot
On-line recognition of interval graphs in O(m+nlog n) time
inferredcites →https://doi.org/10.1007/3-540-62559-3_15openalex-snapshot
LexBFS-orderings and powers of graphs
inferredcites →https://doi.org/10.1007/978-3-540-30559-0_1openalex-snapshot
Lexicographic Breadth First Search – A Survey
inferredcites →https://doi.org/10.1007/978-3-642-00202-1_17openalex-snapshot
A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
inferredcites →https://doi.org/10.1007/978-94-009-5315-4_2openalex-snapshot
Algorithmic Aspects of Comparability Graphs and Interval Graphs
inferredcites →https://doi.org/10.1007/s00453-009-9291-6openalex-snapshot
A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs
inferredcites →https://doi.org/10.1016/0020-0190(88)90091-9openalex-snapshot
A unified approach to domination problems on interval graphs
inferredcites →https://doi.org/10.1016/0020-0190(95)00046-fopenalex-snapshot
Simple linear time recognition of unit interval graphs
inferredcites →https://doi.org/10.1016/0020-0190(95)00133-wopenalex-snapshot
A linear-time algorithm for proper interval graph recognition
inferredcites →https://doi.org/10.1016/0166-218x(88)90071-6openalex-snapshot
End vertices in interval graphs
inferredcites →https://doi.org/10.1016/0166-218x(93)90027-lopenalex-snapshot
A linear time and space algorithm to recognize interval orders
inferredcites →https://doi.org/10.1016/0196-8858(88)90019-xopenalex-snapshot
On the semi-perfect elimination
inferredcites →https://doi.org/10.1016/0898-1221(93)90308-iopenalex-snapshot
Optimal greedy algorithms for indifference graphs
inferredcites →https://doi.org/10.1016/j.dam.2003.07.001openalex-snapshot
A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
inferredcites →https://doi.org/10.1016/j.dam.2004.10.001openalex-snapshot
Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability 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.tcs.2019.01.007openalex-snapshot
Fully dynamic representations of interval graphs
inferredcites →https://doi.org/10.1016/s0020-0190(03)00298-9openalex-snapshot
A linear time recognition algorithm for proper interval graphs
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.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.1017/cbo9780511662119.009openalex-snapshot
New Perspectives on Interval Orders and Interval Graphs
inferredcites →https://doi.org/10.1017/cbo9781107279667.013openalex-snapshot
Introduction to algorithms
inferredcites →https://doi.org/10.1137/0205021openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Graphs
inferredcites →https://doi.org/10.1137/0218005openalex-snapshot
An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
inferredcites →https://doi.org/10.1137/s0097539700372216openalex-snapshot
A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs
inferredcites →https://doi.org/10.1137/s0097539703437855openalex-snapshot
Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
inferredcites →https://doi.org/10.1137/s0097539792224814openalex-snapshot
Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
inferredcites →https://doi.org/10.1137/s0097539792269095openalex-snapshot
Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
inferredcites →https://doi.org/10.1137/s0097539793260726openalex-snapshot
$O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
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/s0895480100373455openalex-snapshot
The LBFS Structure and Recognition of Interval Graphs
inferredcites →https://doi.org/10.1137/s0895480103430259openalex-snapshot
Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs
inferredcites →https://doi.org/10.1137/s0895480193250125openalex-snapshot
Asteroidal Triple-Free Graphs
inferredcites →https://doi.org/10.2307/2981909openalex-snapshot
Interval Orders and Interval Graphs: A Study of Partially Ordered Sets.
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/314613.314697openalex-snapshot
The ultimate interval graph recognition algorithm
inferredcites →https://doi.org/10.7155/jgaa.00293openalex-snapshot
Maximal Neighborhood Search and Rigid 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/s00357-017-9230-1openalex-snapshot
Robinsonian Matrices: Recognition Challenges
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.2024.08.016openalex-snapshot
Semi-proper interval graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2018.07.014openalex-snapshot
A five-element transformation monoid on labelled trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.07.012openalex-snapshot
A simple linear time algorithm to solve the MIST problem on interval graphs
inferred← citeshttps://doi.org/10.1137/1.9781611976496.11openalex-snapshot
Recognizing (Unit) Interval Graphs by Zigzag Graph Searches
inferred← citeshttps://doi.org/10.1137/19m1280399openalex-snapshot
Graph Classes and Forbidden Patterns on Three Vertices
inferred← citeshttps://doi.org/10.23638/dmtcs-22-4-13openalex-snapshot
The LexCycle on $\overline{P_{2}\cup P_{3}}$-free Cocomparability Graphs
inferred← citeshttps://doi.org/10.70675/e6355c4bz172az40e5z90a6ze5635bc0e918openalex-snapshot
Structural and algorithmic aspects of (multiple) interval graphs
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.