1221 search results - page 84 / 245 » Balanced graph partitioning |
139
click to vote
IWPEC
2009
Springer
16 years 19 days ago
2009
Springer
Abstract. We show that the partitions of an n-element set into k members of a given set family can be counted in time O((2− )n ), where > 0 depends only on the maximum size am...
171
click to vote
LICS
2003
IEEE
15 years 11 months ago
2003
IEEE
We define the class of micro-macro stack graphs, a new class of graphs modeling infinite-state sequential systems with a decidable model-checking problem. Micro-macro stack grap...
173
click to vote
CPC
2007
15 years 6 months ago
2007
Abstract. Szemer´edi’s regularity lemma for graphs has proved to be a powerful tool with many subsequent applications. The objective of this paper is to extend the techniques de...
155
click to vote
SIAMDM
2008
15 years 6 months ago
2008
We consider the class of graphs that contain no bull, no odd hole, and no antihole of length at least five. We present a new algorithm that colors optimally the vertices of every g...
197
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the re...