Mixed Search Number of Permutation Graphs

Authors:
Pinar Heggernes;Rodica Mihai
Affiliations:
Department of Informatics, University of Bergen, Bergen, Norway N-5020;Department of Informatics, University of Bergen, Bergen, Norway N-5020
Venue:
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Year:
2008

Citing 21
Cited 3

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
Characterizations and algorithmic applications of chordal graph embeddings

Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
Graph classes: a survey

Graph classes: a survey
Eavesdropping games: a graph-theoretic approach to privacy in distributed systems

Journal of the ACM (JACM)
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)
Contiguous Search in the Hypercube for Capturing an Intruder

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Node-searching problem on block graphs

Discrete Applied Mathematics
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences
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
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

Edge Search Number of Cographs in Linear Time

FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Edge search number of cographs

Discrete Applied Mathematics
Pathwidth and searching in parameterized threshold graphs

WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Search games in graphs have attracted significant attention in recent years, and they have applications in securing computer networks against viruses and intruders. Since graph searching is an NP-hard problem, polynomial-time algorithms have been given for solving it on various graph classes. Most of these algorithms concern computing the node search number of a graph, and only few such algorithms are known for computing the mixed search or edge search numbers of specific graph classes. In this paper we show that the mixed search number of permutation graphs can be computed in linear time, and we describe an algorithm for this purpose. In addition, we give a complete characterization of the edge search number of complete bipartite graphs.