2314 search results - page 182 / 463 » Minimal Partitions of a Graph |
139
click to vote
ICAIL
2009
ACM
15 years 8 months ago
2009
ACM
We propose an analysis of the codified Law of France as a structured system. Fifty two legal codes are selected on the basis of explicit legal criteria and considered as vertices ...
147
click to vote
ANOR
2004
15 years 4 months ago
2004
We consider the multilevel paradigm and its potential to aid the solution of combinatorial optimisation problems. The multilevel paradigm is a simple one, which at its most basic ...
126
click to vote
COCOC
1995
15 years 7 months ago
1995
We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree o...
133
click to vote
ICCV
2005
IEEE
16 years 6 months ago
2005
IEEE
The goal of deconvolution is to recover an image x from its convolution with a known blurring function. This is equivalent to inverting the linear system y = Hx. In this paper we ...
146
click to vote
PPL
2008
15 years 4 months ago
2008
We provide self-stabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linea...