Connected graph searching in chordal graphs (Q967304)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Connected graph searching in chordal graphs	scientific article

Statements

scholarly article

Connected graph searching in chordal graphs (English)

Discrete Applied Mathematics

publication date

28 April 2010

zbMATH Keywords

graph searching

treewidth

chordal graphs

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1016/j.dam.2008.08.007

Graph-Theoretic Concepts in Computer Science

Monotonicity in graph searching

Treewidth for graphs with small chordality

Fugitive-search games on graphs and related parameters

Connected Treewidth and Connected Graph Searching

On the pathwidth of chordal graphs

Searching and pebbling

Treewidth of Chordal Bipartite Graphs

Recontamination does not help to search a graph

The complexity of searching a graph

Characterizations and algorithmic applications of chordal graph embeddings

Graph minors. II. Algorithmic aspects of tree-width

Graph searching and a min-max theorem for tree-width

Algorithms and Computation

Identifiers

zbMATH Open document ID

10.1016/j.dam.2008.08.007

Mathematics Subject Classification ID

zbMATH DE Number

Sitelinks

Mathematics(1 entry)

mardi Publication:967304

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q967304&oldid=35167820"