Searching expenditure and interval graphs

DOI10.1016/S0166-218X(02)00297-4zbMATH Open0913.05059WikidataQ60488776 ScholiaQ60488776MaRDI QIDQ4242800FDOQ4242800

Authors: Fedor V. Fomin 

Publication date: 11 May 1999

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

Recommendations

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

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)

Cites Work

• Searching and pebbling
• Eavesdropping games
• Title not available (Why is that?)
• The complexity of searching a graph
• Recontamination does not help to search a graph
• The vertex separation and search number of a graph
• Fugitive-search games on graphs and related parameters
• Monotonicity in graph searching
• Topological Bandwidth
• On minimizing width in linear layouts
• Optimal Algorithms for a Pursuit-Evasion Problem in Grids
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The total vertex separation number and profile of a graph
• Title not available (Why is that?)

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)