45 search results - page 7 / 9 » Connectedness of the graph of vertex-colourings |
CDC
2008
IEEE
14 years 1 months ago
2008
IEEE
— In this paper we examine the leader-to-follower ratio needed to maintain connectivity in a leader-follower multiagent network with proximity based communication topology. In th...
JMIV
2008
13 years 7 months ago
2008
Region merging methods consist of improving an initial segmentation by merging some pairs of neighboring regions. In this paper, we consider a segmentation as a set of connected r...
JGT
2007
13 years 7 months ago
2007
A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...
VIZSEC
2004
Springer
14 years 22 days ago
2004
Springer
We describe a framework for managing network attack graph complexity through interactive visualization, which includes hierarchical aggregation of graph elements. Aggregation coll...
WWW
2003
ACM
14 years 8 months ago
2003
ACM
We propose two new tools to address the evolution of hyperlinked corpora. First, we define time graphs to extend the traditional notion of an evolving directed graph, capturing li...