2314 search results - page 87 / 463 » Minimal Partitions of a Graph |
106
Voted
ENDM
2002
15 years 3 months ago
2002
We prove that a claw-free, 2-connected graph with fewer than 18 vertices is traceable, and we determine all non-traceable, claw-free, 2-connected graphs with exactly 18 vertices an...
146
Voted
SIGMOD
2010
ACM
15 years 8 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
137
Voted
IWPEC
2009
Springer
15 years 10 months 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...
106
click to vote
IWPEC
2009
Springer
15 years 10 months 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...
141
click to vote
LICS
2003
IEEE
15 years 8 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...