On the public citation graph

Graph searching on chordal graphs

https://doi.org/10.1007/bfb0009491
0 signed · 33 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/3-540-56939-1_66openalex-snapshot
Treewidth and pathwidth of permutation graphs
inferredcites →https://doi.org/10.1007/978-3-642-46908-4openalex-snapshot
Topics in combinatorics and graph theory : essays in honour of Gerhard Ringel
inferredcites →https://doi.org/10.1007/978-3-642-46908-4_70openalex-snapshot
A Linear Algorithm for the Pathwidth of Trees
inferredcites →https://doi.org/10.1007/978-3-7091-9076-0_2openalex-snapshot
Graph Problems Related to Gate Matrix Layout and PLA Folding
inferredcites →https://doi.org/10.1007/bfb0070359openalex-snapshot
Theory and Applications of Graphs
inferredcites →https://doi.org/10.1007/bfb0070400openalex-snapshot
Pursuit-evasion in a graph
inferredcites →https://doi.org/10.1016/0012-365x(85)90046-9openalex-snapshot
Interval graphs and seatching
inferredcites →https://doi.org/10.1016/0020-0190(92)90234-mopenalex-snapshot
The vertex separation number of a graph equals its path-width
inferredcites →https://doi.org/10.1016/0095-8956(74)90094-xopenalex-snapshot
The intersection graphs of subtrees in trees are exactly the chordal graphs
inferredcites →https://doi.org/10.1016/0095-8956(83)90079-5openalex-snapshot
Graph minors. I. Excluding a forest
inferredcites →https://doi.org/10.1016/0166-218x(92)90208-ropenalex-snapshot
Narrowness, pathwidth, and their application in natural language processing
inferredcites →https://doi.org/10.1016/0166-218x(93)90012-dopenalex-snapshot
On the pathwidth of chordal graphs
inferredcites →https://doi.org/10.1016/0196-6774(91)90003-hopenalex-snapshot
Monotonicity in graph searching
inferredcites →https://doi.org/10.1016/0304-3975(86)90146-5openalex-snapshot
Searching and pebbling
inferredcites →https://doi.org/10.1016/0304-3975(88)90028-xopenalex-snapshot
Min cut is NP-complete for edge weighted trees
inferredcites →https://doi.org/10.1137/0406014openalex-snapshot
The Pathwidth and Treewidth of Cographs
inferredcites →https://doi.org/10.1137/0608024openalex-snapshot
Complexity of Finding Embeddings in a k -Tree
inferredcites →https://doi.org/10.1145/151261.151263openalex-snapshot
Recontamination does not help to search a graph
inferredcites →https://doi.org/10.1145/42267.42268openalex-snapshot
The complexity of searching a graph
inferredcites →https://doi.org/10.2307/2287146openalex-snapshot
The Theory and Applications of Graphs.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/net.20240openalex-snapshot
Decontamination of hypercubes by mobile agents
inferred← citeshttps://doi.org/10.1007/11604655_17openalex-snapshot
Cleaning an Arbitrary Regular Network with Mobile Agents
inferred← citeshttps://doi.org/10.1007/11945918_23openalex-snapshot
Capturing an Intruder in Product Networks
inferred← citeshttps://doi.org/10.1007/3-540-68535-9_32openalex-snapshot
A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree
inferred← citeshttps://doi.org/10.1007/978-3-642-16074-5_7openalex-snapshot
Secure Upgrade of Hardware Security Modules in Bank Networks
inferred← citeshttps://doi.org/10.1007/bfb0045095openalex-snapshot
Edge and node searching problems on trees
inferred← citeshttps://doi.org/10.1016/j.jpdc.2007.04.013openalex-snapshot
Capturing an intruder in product networks
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00241-8openalex-snapshot
Edge and node searching problems on trees
inferred← citeshttps://doi.org/10.1109/iccgi.2007.43openalex-snapshot
On the Complexity of Decontaminating an Hexagonal Mesh Network
inferred← citeshttps://doi.org/10.1109/icis.2007.87openalex-snapshot
Decontamination of Arbitrary Networks using a Team of Mobile Agents with Limited Visibility
inferred← citeshttps://doi.org/10.1109/ipdps.2005.151openalex-snapshot
Contiguous Search in the Hypercube for Capturing an Intruder
inferred← citeshttps://doi.org/10.1109/tpds.2008.108openalex-snapshot
Detecting Threats in Star Graphs
inferred← citeshttps://doi.org/10.22215/etd/2005-10780openalex-snapshot
Intruder capture by mobile agents in mesh topologies
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.