Edge search number of cographs
type: Item
instance of: scholarly article
title: Edge search number of cographs
zbMATH Open document ID: 1238.68107
author: Petr A. Golovach
author: Pinar Heggernes
author: Rodica Mihai
published in: Discrete Applied Mathematics
publication date: 2012-05-11T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 6033758
zbMATH Keywords: graph searching
zbMATH Keywords: NP-hard problem
zbMATH Keywords: polynomial-time algorithm
zbMATH Keywords: graph classes
zbMATH Keywords: cographs
MaRDI profile type: Publication
full work available at URL: j.dam.2011.04.020
OpenAlex ID: W2068664205
cites work: The theory of search games and rendezvous.
cites work: Lower Bounds on Edge Searching
cites work: Q4035355
cites work: Monotonicity in graph searching
cites work: Treewidth and Pathwidth of Permutation Graphs
cites work: Treewidth and Minimum Fill-in on d-Trapezoid Graphs
cites work: The Pathwidth and Treewidth of Cographs
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: Graph Classes: A Survey
cites work: Node-searching problem on block graphs
cites work: Complement reducible graphs
cites work: A Linear Recognition Algorithm for Cographs
cites work: Computing the vertex separation of unicyclic graphs
cites work: Mathematical Foundations of Computer Science 2005
cites work: Mixed Search Number and Linear-Width of Interval and Split Graphs
cites work: An annotated bibliography on guaranteed graph searching
cites work: Q3199182
cites work: Q3483321
cites work: Q3351169
cites work: Some generalizations of the problem on the search number of a graph
cites work: Algorithmic graph theory and perfect graphs
cites work: On the pathwidth of chordal graphs
cites work: A simple linear time algorithm for cograph recognition
cites work: Mixed Search Number of Permutation Graphs
cites work: Edge Search Number of Cographs in Linear Time
cites work: Interval graphs and searching
cites work: Searching and pebbling
cites work: Recontamination does not help to search a graph
cites work: Monotonicity of non-deterministic graph searching
cites work: The complexity of searching a graph
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Q4159394
cites work: Edge and node searching problems on trees
cites work: Graph searching on some subclasses of chordal graphs
cites work: On the Treewidth and Pathwidth of Biconvex Bipartite Graphs
cites work: Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time
cites work: Pathwidth of Circular-Arc Graphs
cites work: Mixed searching and proper-path-width
cites work: Searching Cycle-Disjoint Graphs
DOI: 10.1016/J.DAM.2011.04.020
Recommended article: Edge Search Number of Cographs in Linear Time
Recommended article: Edge search in hypergraphs
Recommended article: Edge-domatic number of a graph
Recommended article: Edge search in graphs and hypergraphs of bounded rank
Recommended article: The edge numbers of a class of graphs
Recommended article: Q4864770
Recommended article: Total edge-domatic number of a graph
Recommended article: Q4722115
Recommended article: Q3829586
Recommended article: An NP-completeness result of edge search in graphs
description: scientific article; zbMATH DE number 6033758