Mixed searching and proper-path-width
From MaRDI portal
Publication:674341
DOI10.1016/0304-3975(94)00160-KzbMATH Open0873.68148WikidataQ131836843 ScholiaQ131836843MaRDI QIDQ674341FDOQ674341
Authors: Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani 
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Graph minors. XX: Wagner's conjecture
- Searching and pebbling
- Graph minors. XIII: The disjoint paths problem
- Complexity of Finding Embeddings in a k-Tree
- Title not available (Why is that?)
- The complexity of searching a graph
- Recontamination does not help to search a graph
- Graph minors. I. Excluding a forest
- Minimal acyclic forbidden minors for the family of graphs with bounded path-width
- Monotonicity in graph searching
- Title not available (Why is that?)
- Interval graphs and searching
- Mixed searching and proper-path-width
- Title not available (Why is that?)
- Title not available (Why is that?)
- The NP-completeness column: An ongoing guide
- Title not available (Why is that?)
Cited In (29)
- On the parameterized complexity of \([1,j]\)-domination problems
- Title not available (Why is that?)
- Minimum dominating set of queens: a trivial programming exercise?
- Edge Search Number of Cographs in Linear Time
- Edge search number of cographs
- An annotated bibliography on guaranteed graph searching
- Searching for a Visible, Lazy Fugitive
- Mixed searching and proper-path-width
- Embeddings of \(k\)-connected graphs of pathwidth \(k\)
- A partial k-arboretum of graphs with bounded treewidth
- The mixed search game against an agile and visible fugitive is monotone
- Contraction obstructions for connected graph searching
- Graph Searching in a Crime Wave
- Parameterized orientable deletion
- Finding small-width connected path decompositions in polynomial time
- Searching for Differential Paths in MD4
- Strong-mixed searching and pathwidth
- On the monotonicity of games generated by symmetric submodular functions.
- On the Parameterized Complexity of [1,j]-Domination Problems
- Algorithms and obstructions for linear-width and related search parameters
- Mixed search number and linear-width of interval and split graphs
- Lower bounds for protrusion replacement by counting equivalence classes
- Parameters related to tree-width, zero forcing, and maximum nullity of a graph
- Structurally parameterized \(d\)-scattered set
- Throttling for zero forcing and variants
- On the Cooperative Graph Searching Problem
- Mixed Search Number of Permutation Graphs
- Mixed Search Number and Linear-Width of Interval and Split Graphs
- Pure Nash equilibria in graphical games and treewidth
This page was built for publication: Mixed searching and proper-path-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674341)
