Edge Search Number of Cographs in Linear Time

Authors:
Pinar Heggernes;Rodica Mihai
Affiliations:
Department of Informatics, University of Bergen, Norway;Department of Informatics, University of Bergen, Norway
Venue:
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Year:
2009

Citing 27
Cited 1

Searching and pebbling

Theoretical Computer Science
The complexity of searching a graph

Journal of the ACM (JACM)
Monotonicity in graph searching

Journal of Algorithms
Recontamination does not help to search a graph

Journal of the ACM (JACM)
On the pathwidth of chordal graphs

Discrete Applied Mathematics - ARIDAM IV and V
Mixed searching and proper-path-width

Theoretical Computer Science
Treewidth and Pathwidth of Permutation Graphs

SIAM Journal on Discrete Mathematics
On treewidth and minimum fill-in of asteroidal triple-free graphs

Ordal'94 Selected papers from the conference on Orders, algorithms and applications
Graph classes: a survey

Graph classes: a survey
Edge and node searching problems on trees

Theoretical Computer Science - computing and combinatorics
The Pathwidth and Treewidth of Cographs

SWAT '90 Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory
Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time

Journal of Algorithms
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Computing the vertex separation of unicyclic graphs

Information and Computation
Node-searching problem on block graphs

Discrete Applied Mathematics
An annotated bibliography on guaranteed graph searching

Theoretical Computer Science
Monotonicity of non-deterministic graph searching

Theoretical Computer Science
Mixed Search Number of Permutation Graphs

FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Nondeterministic Graph Searching: From Pathwidth to Treewidth

Algorithmica
A simple linear time algorithm for cograph recognition

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences
On the treewidth and pathwidth of biconvex bipartite graphs

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Pathwidth of circular-arc graphs

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Mixed search number and linear-width of interval and split graphs

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Searching cycle-disjoint graphs

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Computing treewidth and minimum fill-in for permutation graphs in linear time

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Lower bounds on edge searching

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

Edge search number of cographs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a linear-time algorithm for computing the edge search number of cographs, thereby proving that this problem can be solved in polynomial time on this graph class. With our result, the knowledge on graph searching of cographs is now complete: node, mixed, and edge search numbers of cographs can all be computed efficiently. Furthermore, we are one step closer to computing the edge search number of permutation graphs.