On the public citation graph
A Unified View of Graph Searching
0 signed · 93 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.1016/0166-218x(84)90008-8openalex-snapshot
Some aspects of perfect elimination orderings in chordal graphs
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/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/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
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.2140/pjm.1965.15.835openalex-snapshot
Incidence matrices and interval graphs
inferredcites →https://doi.org/10.46298/dmtcs.303openalex-snapshot
Partially complemented representations of digraphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.21795openalex-snapshot
Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number
inferred← citeshttps://doi.org/10.1002/jgt.22929openalex-snapshot
A new graph parameter to measure linearity
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_685openalex-snapshot
Unified View of Graph Searching and LDFS-Based Certifying Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-25027-0_14openalex-snapshot
Space Efficient Algorithms for Breadth-Depth Search
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-030-83823-2_55openalex-snapshot
Graphs Where Search Methods Are Indistinguishable
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-22050-0_9openalex-snapshot
The Complexity of Growing a Graph
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-032-27732-9_10openalex-snapshot
Breadth-First Search Trees with Many or Few Leaves
inferred← citeshttps://doi.org/10.1007/978-3-319-08404-6_28openalex-snapshot
Linear Time LexDFS on Cocomparability Graphs.
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/978-3-319-51367-6_7openalex-snapshot
A LexDFS-Based Approach on Finding Compact Communities
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_685-1openalex-snapshot
Unified View of Graph Searching and LDFS-Based Certifying Algorithms
inferred← citeshttps://doi.org/10.1007/s00440-010-0325-4openalex-snapshot
The continuum limit of critical random graphs
inferred← citeshttps://doi.org/10.1007/s00453-022-00981-5openalex-snapshot
Graph Searches and Their End Vertices
inferred← citeshttps://doi.org/10.1007/s11083-023-09641-xopenalex-snapshot
Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications
inferred← citeshttps://doi.org/10.1007/s12652-021-03374-8openalex-snapshot
Gravity algorithm for the community detection of large-scale network
inferred← citeshttps://doi.org/10.1016/j.dam.2009.10.001openalex-snapshot
On end-vertices of Lexicographic Breadth First Searches
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.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.2015.06.011openalex-snapshot
A tie-break model for graph search
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.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.entcs.2019.08.010openalex-snapshot
Recognizing Graph Search Trees
inferred← citeshttps://doi.org/10.1016/j.ic.2026.105494openalex-snapshot
Partial search orderings for MCS on chordal graphs via clique graph decomposition
inferred← citeshttps://doi.org/10.1016/j.inpa.2019.04.002openalex-snapshot
A hybrid weed optimized coverage path planning technique for autonomous harvesting in cashew orchards
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.ipl.2021.106176openalex-snapshot
End vertices of graph searches on bipartite graphs
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.1016/j.tcs.2019.05.030openalex-snapshot
Bayesian networks: The minimal triangulations of a graph
inferred← citeshttps://doi.org/10.1109/icotl59758.2023.10435213openalex-snapshot
Identifying the credit risk of listed company located in the guaranteed network
inferred← citeshttps://doi.org/10.1109/nics.2018.8606881openalex-snapshot
Linear time algorithm for maximum distance-k matching in interval graphs
inferred← citeshttps://doi.org/10.1109/tro.2023.3339989openalex-snapshot
A Novel Graph-Based Motion Planner of Multi-Mobile Robot Systems With Formation and Obstacle Constraints
inferred← citeshttps://doi.org/10.1109/waina.2009.114openalex-snapshot
Web Site Management System through Private Information Extraction
inferred← citeshttps://doi.org/10.1137/060664690openalex-snapshot
A Simple Linear Time LexBFS Cograph Recognition Algorithm
inferred← citeshttps://doi.org/10.1137/070684355openalex-snapshot
Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings
inferred← citeshttps://doi.org/10.1137/100793529openalex-snapshot
A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs
inferred← citeshttps://doi.org/10.1137/11083856xopenalex-snapshot
LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs
inferred← citeshttps://doi.org/10.1137/15m1012396openalex-snapshot
On the Power of Graph Searching for Cocomparability Graphs
inferred← citeshttps://doi.org/10.1137/17m1120920openalex-snapshot
A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs
inferred← citeshttps://doi.org/10.1137/19m1280399openalex-snapshot
Graph Classes and Forbidden Patterns on Three Vertices
inferred← citeshttps://doi.org/10.1137/20m1313301openalex-snapshot
The Recognition Problem of Graph Search Trees
inferred← citeshttps://doi.org/10.1145/2808797.2808868openalex-snapshot
Finding compact communities in large graphs
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.1145/3638530.3664141openalex-snapshot
GOLEM: Flexible Evolutionary Design of Graph Representations of Physical and Digital Objects
inferred← citeshttps://doi.org/10.1145/3711844openalex-snapshot
Computing Hamiltonian Paths with Partial Order Restrictions
inferred← citeshttps://doi.org/10.1145/3833142.3833160openalex-snapshot
Frontier-Based Formulations of Graph Traversal and Single-Source Shortest Paths
inferred← citeshttps://doi.org/10.18690/978-961-286-516-0openalex-snapshot
Proceedings of the 2021 7th Student Computer Science Research Conference (StuCoSReC)
inferred← citeshttps://doi.org/10.18690/978-961-286-516-0.10openalex-snapshot
Transformer-based Sarcasm Detection in English and Slovene Language
inferred← citeshttps://doi.org/10.18690/978-961-286-516-0.11openalex-snapshot
Extraction and Analysis of Sport Activity Data Inside Certain Area
inferred← citeshttps://doi.org/10.18690/978-961-286-516-0.13openalex-snapshot
Embedding Non-planar Graphs: Storage and Representation
inferred← citeshttps://doi.org/10.18690/978-961-286-516-0.14openalex-snapshot
Analiza ritmičnosti števnih podatkov z uporabo modela cosinor
inferred← citeshttps://doi.org/10.18690/978-961-286-516-0.15openalex-snapshot
Analiza sentimenta komentarjev hotelov z uporabo slovarjev in metode Naivni Bayes
inferred← citeshttps://doi.org/10.18690/978-961-286-516-0.16openalex-snapshot
Časovni razporejevalniki in brezstrežniško okolje
inferred← citeshttps://doi.org/10.18690/978-961-286-516-0.2openalex-snapshot
Zero-Knowledge Authentication
inferred← citeshttps://doi.org/10.18690/978-961-286-516-0.3openalex-snapshot
Graphs where Search Methods are Indistinguishable
inferred← citeshttps://doi.org/10.18690/978-961-286-516-0.6openalex-snapshot
Adversarial Image Perturbation with a Genetic Algorithm
inferred← citeshttps://doi.org/10.18690/978-961-286-516-0.8openalex-snapshot
Interactive Evolutionary Computation Approach to Permutation Flow Shop Scheduling Problem
inferred← citeshttps://doi.org/10.18690/978-961-286-516-0.9openalex-snapshot
Towards Representative Web Performance Measurements with Google Lighthouse
inferred← citeshttps://doi.org/10.23638/dmtcs-21-1-13openalex-snapshot
On the End-Vertex Problem of Graph Searches
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.26493/1855-3974.3238.2a8openalex-snapshot
On the leaves of graph search trees
inferred← citeshttps://doi.org/10.29007/8jb5openalex-snapshot
Traversal-invariant definability and Logarithmic-space computation
inferred← citeshttps://doi.org/10.31274/td-20240329-606openalex-snapshot
Propagation processes on graphs and applications
inferred← citeshttps://doi.org/10.3390/a10010020openalex-snapshot
Computing a Clique Tree with the Algorithm Maximal Label Search
inferred← citeshttps://doi.org/10.3390/a3020100openalex-snapshot
Graph Extremities Defined by Search Algorithms
inferred← citeshttps://doi.org/10.3390/e26060490openalex-snapshot
Continuous-Time Quantum Walk in Glued Trees: Localized State-Mediated Almost Perfect Quantum-State Transfer
inferred← citeshttps://doi.org/10.4230/lipics.esa.2020.13openalex-snapshot
Linear Time LexDFS on Chordal Graphs
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2021.17openalex-snapshot
Graph Traversals as Universal Constructions
inferred← citeshttps://doi.org/10.4230/oasics.tannen.2openalex-snapshot
Traversal-Invariant Characterizations of Logarithmic Space
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.46298/dmtcs.2094openalex-snapshot
A four-sweep LBFS recognition algorithm for interval graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1701.00305openalex-snapshot
(Quasi-)linear time algorithm to compute LexDFS, LexUP and LexDown orderings
inferred← citeshttps://doi.org/10.48550/arxiv.1810.09974openalex-snapshot
Algorithmic Traversals of Infinite Graphs
inferred← citeshttps://doi.org/10.5335/rbca.v8i2.5602openalex-snapshot
Extensões e caracterizações de buscas para hipergrafos com arestas múltiplas
inferred← citeshttps://doi.org/10.5772/61816openalex-snapshot
K-Means Partitioned Space Path Planning (KPSPP) for Autonomous Robotic Harvesting
inferred← citeshttps://doi.org/10.5936/csbj.201302013openalex-snapshot
AUTOMATED DETECTION OF STRUCTURAL ALERTS (CHEMICAL FRAGMENTS) IN (ECO)TOXICOLOGY
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.