Searching expenditure and interval graphs

DOI10.1016/S0166-218X(02)00297-4MaRDI QIDQ4242800zbMATH OpenWikidataFDO

Authors Fedor V. Fomin

Publication date 11 May 1999

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

tree-widthgraph searchingpebblingpursuit-evasiongame on a graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Games involving graphs (91A43)

Recommendations

• Graph searching and interval completion
• On minimum cost edge searching
• SOFSEM 2006: Theory and Practice of Computer Science
• Searching is not jumping.

Cites work

• scientific article; zbMATH DE number 4147519 (Why is no real title available?)
• scientific article; zbMATH DE number 3819512 (Why is no real title available?)
• scientific article; zbMATH DE number 3780976 (Why is no real title available?)
• scientific article; zbMATH DE number 176249 (Why is no real title available?)
• scientific article; zbMATH DE number 3590298 (Why is no real title available?)
• scientific article; zbMATH DE number 1151792 (Why is no real title available?)
• Eavesdropping games
• Fugitive-search games on graphs and related parameters
• Monotonicity in graph searching
• On minimizing width in linear layouts
• Optimal Algorithms for a Pursuit-Evasion Problem in Grids
• Recontamination does not help to search a graph
• Searching and pebbling
• The complexity of searching a graph
• The total vertex separation number and profile of a graph
• The vertex separation and search number of a graph
• Topological Bandwidth

Cited in

(1)

• Graph searching and interval completion

This page was built for publication: Searching expenditure and interval graphs

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