Mixed Search Number of Permutation Graphs

DOI10.1007/978-3-540-69311-6_22MaRDI QIDQ3507333zbMATH OpenOpenAlexFDO

Authors Pinar Heggernes, Rodica Mihai

Publication date 19 June 2008

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69311-6_22

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Fast-mixed searching on graphs
• Fast-mixed searching and related problems on graphs
• Mixed searching and proper-path-width
• Edge search number of cographs
• The complexity of searching a graph

Cites work

• A Characterization of Comparability Graphs and of Interval Graphs
• Algorithmic graph theory and perfect graphs
• Characterizations and algorithmic applications of chordal graph embeddings
• Complement reducible graphs
• Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time
• Eavesdropping games
• Edge and node searching problems on trees
• Graph Classes: A Survey
• Graph searching on some subclasses of chordal graphs
• Graph-Theoretic Concepts in Computer Science
• scientific article; zbMATH DE number 176249 (Why is no real title available?)
• scientific article; zbMATH DE number 3590298 (Why is no real title available?)
• Interval graphs and searching
• Mixed Search Number and Linear-Width of Interval and Split Graphs
• Mixed searching and proper-path-width
• Monotonicity in graph searching
• Node-searching problem on block graphs
• On the pathwidth of chordal graphs
• On treewidth and minimum fill-in of asteroidal triple-free graphs
• Pathwidth of Circular-Arc Graphs
• Recontamination does not help to search a graph
• Searching and pebbling
• Some generalizations of the problem on the search number of a graph
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• The complexity of searching a graph
• The pathwidth and treewidth of cographs
• The theory of search games and rendezvous.
• Treewidth and Minimum Fill-in on d-Trapezoid Graphs
• Treewidth and Pathwidth of Permutation Graphs

Cited in

(6)

• Mixed search number and linear-width of interval and split graphs
• Edge search number of cographs
• Edge Search Number of Cographs in Linear Time
• Exclusive graph searching vs. pathwidth
• Strong-mixed searching and pathwidth
• Minimum dominating set of queens: a trivial programming exercise?

This page was built for publication: Mixed Search Number of Permutation Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3507333)