Sciweavers

2314 search results - page 28 / 463
» Minimal Partitions of a Graph
Sort
View
DAM
2008
78views more  DAM 2008»
13 years 8 months ago
On classes of minimal circular-imperfect graphs
Circular-perfect graphs form a natural superclass of perfect graphs: on the one hand due to their definition by means of a more general coloring concept, on the other hand as an i...
Arnaud Pêcher, Annegret Wagler
ALGOSENSORS
2006
Springer
14 years 6 days ago
A Flexible Algorithm for Sensor Network Partitioning and Self-partitioning Problems
Abstract. Motivated by the need for agent classification in sensor networking and autonomous vehicle control applications, we propose a flexible and distributed stochastic automato...
Sandip Roy, Yan Wan, Ali Saberi
FOCS
2009
IEEE
14 years 3 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
COCOON
1999
Springer
14 years 22 days ago
Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
Xuemin Lin, Peter Eades
APPROX
2009
Springer
107views Algorithms» more  APPROX 2009»
14 years 3 months ago
Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs
We consider the problem of aligned coloring of interval and chordal graphs. These problems have substantial applications to register allocation in compilers and have recently been ...
Douglas E. Carroll, Adam Meyerson, Brian Tagiku