823 search results - page 51 / 165 » Brick partitions of graphs |
191
click to vote
EMMCVPR
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Grouping is a global partitioning process that integrates local cues distributed over the entire image. We identify four types of pairwise relationships, attraction and r...
158
click to vote
COLT
2007
Springer
16 years 8 days ago
2007
Springer
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
179
click to vote
IWPEC
2009
Springer
16 years 20 days ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
139
click to vote
IWPEC
2009
Springer
16 years 20 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...