Edge search number of cographs
From MaRDI portal
Publication:415273
DOI10.1016/J.DAM.2011.04.020zbMATH Open1238.68107OpenAlexW2068664205MaRDI QIDQ415273FDOQ415273
Rodica Mihai, Pinar Heggernes, Petr A. Golovach
Publication date: 11 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.04.020
Recommendations
- Edge Search Number of Cographs in Linear Time
- Edge search in hypergraphs
- Edge-domatic number of a graph
- Edge search in graphs and hypergraphs of bounded rank
- The edge numbers of a class of graphs
- scientific article; zbMATH DE number 846942
- Total edge-domatic number of a graph
- scientific article; zbMATH DE number 3993644
- scientific article
- An NP-completeness result of edge search in graphs
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10)
Cites Work
- Graph Classes: A Survey
- Complement reducible graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The theory of search games and rendezvous.
- Searching and pebbling
- Algorithmic graph theory and perfect graphs
- An annotated bibliography on guaranteed graph searching
- Title not available (Why is that?)
- The complexity of searching a graph
- Recontamination does not help to search a graph
- On the pathwidth of chordal graphs
- Pathwidth of Circular-Arc Graphs
- A Linear Recognition Algorithm for Cographs
- Monotonicity in graph searching
- The Pathwidth and Treewidth of Cographs
- Treewidth and Pathwidth of Permutation Graphs
- Monotonicity of non-deterministic graph searching
- A simple linear time algorithm for cograph recognition
- Interval graphs and searching
- Computing the vertex separation of unicyclic graphs
- Treewidth and Minimum Fill-in on d-Trapezoid Graphs
- Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time
- Title not available (Why is that?)
- Some generalizations of the problem on the search number of a graph
- Edge and node searching problems on trees
- Graph searching on some subclasses of chordal graphs
- Node-searching problem on block graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mixed Search Number of Permutation Graphs
- Mixed Search Number and Linear-Width of Interval and Split Graphs
- Lower Bounds on Edge Searching
- Searching Cycle-Disjoint Graphs
- Edge Search Number of Cographs in Linear Time
- On the Treewidth and Pathwidth of Biconvex Bipartite Graphs
- Mathematical Foundations of Computer Science 2005
- Graph-Theoretic Concepts in Computer Science
- Mixed searching and proper-path-width
Cited In (4)
This page was built for publication: Edge search number of cographs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415273)
