Strong-mixed searching and pathwidth (Q867027): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3418339 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Monotonicity in graph searching / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Eavesdropping games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The vertex separation number of a graph equals its path-width / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Searching and pebbling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recontamination does not help to search a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of searching a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph minors. I. Excluding a forest / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Mixed searching and proper-path-width / rank | |||
Normal rank |
Latest revision as of 14:36, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Strong-mixed searching and pathwidth |
scientific article |
Statements
Strong-mixed searching and pathwidth (English)
0 references
14 February 2007
0 references
Node search
0 references
Edge search
0 references
Mixed search
0 references
Cops-and-robber game
0 references
Pursuit-evasion problem
0 references