352 search results - page 16 / 71 » Partitioning Graphs into Connected Parts |
113
click to vote
EMMCVPR
2001
Springer
15 years 4 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...
102
click to vote
COCOA
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
107
click to vote
JCT
2007
14 years 11 months ago
2007
In answer to a question of Andrews about finding combinatorial proofs of two identities in Ramanujan’s “lost” notebook, we obtain weighted forms of Euler’s theorem on part...
109
click to vote
TON
2008
14 years 11 months ago
2008
Abstract--In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node fail...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
We are interested in verifying dynamic properties of finite state reactive systems under fairness assumptions by model checking. The systems we want to verify are specified throug...