Graph Searching and Interval Completion
From MaRDI portal
Publication:2706178
DOI10.1137/S0895480199350477zbMath0972.05047MaRDI QIDQ2706178
Fedor V. Fomin, Petr A. Golovach
Publication date: 19 March 2001
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (15)
On minimum cost edge searching ⋮ On the monotonicity of games generated by symmetric submodular functions. ⋮ A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. ⋮ Time constrained graph searching ⋮ An annotated bibliography on guaranteed graph searching ⋮ The complexity of minimum-length path decompositions ⋮ Digraph searching, directed vertex separation and directed pathwidth ⋮ Profile minimization on compositions of graphs ⋮ Fixed-parameter complexity of minimum profile problems ⋮ On tradeoffs between width- and fill-like graph parameters ⋮ Network Decontamination with Temporal Immunity by Cellular Automata ⋮ On the interval completion of chordal graphs ⋮ Maximum vertex occupation time and inert fugitive: Recontamination does help ⋮ On the domination search number ⋮ On the profile of the corona of two graphs
This page was built for publication: Graph Searching and Interval Completion
