Sweeping graphs with large clique number

Authors:
Boting Yang;Danny Dyer;Brian Alspach
Affiliations:
Department of Computer Science, University of Regina;Department of Mathematics, Simon Fraser University;Department of Mathematics and Statistics, University of Regina
Venue:
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Year:
2004

Citing 3
Cited 15

The complexity of searching a graph

Journal of the ACM (JACM)
Monotonicity in graph searching

Journal of Algorithms
Recontamination does not help to search a graph

Journal of the ACM (JACM)

Distributed chasing of network intruders

Theoretical Computer Science
Monotonicity of non-deterministic graph searching

Theoretical Computer Science
On the Fast Searching Problem

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Monotony properties of connected visible graph searching

Information and Computation
Graph searching with advice

Theoretical Computer Science
Graph searching with advice

SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Monotonicity of non-deterministic graph searching

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Arc searching digraphs without jumping

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
The cost of monotonicity in distributed graph searching

OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
GSST: anytime guaranteed search

Autonomous Robots
Monotony properties of connected visible graph searching

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Distributed chasing of network intruders

SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Connected treewidth and connected graph searching

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Lower bounds on edge searching

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Hierarchical visibility for guaranteed search in large-scale outdoor terrain

Autonomous Agents and Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

An open problem in sweeping is the existence of a graph with connected sweep number strictly less than monotonic connected sweep number We solve this problem by constructing a graph W exhibiting exactly this property Further, we will examine a new method of constructing graphs that makes proving all such inequalities easier, and offer some new lower bounds on sweep numbers.