Add to ORKGIn this paper we use a single unifying approach (which we call the Principal Lattice of Partitions approach) to construct simple and fast algorithms for problems including and related to the ''Principal Partition' and the ''Generic Rigidity'' of graphs. Most of our algorithms are at least as fast as presently known algorithms fox these problems, while our algorithm for Principal Partition problem (complete partition and the partial orders for all critical values) runs in O(\E\\V\2log2\V\) time and is the fastest known so far
AbstractAdapting the method introduced in Graph Minors X, we propose a new proof of the duality betw...
International audienceAdapting the method introduced in Graph Minors X, we propose a new proof of th...
K-WAY SUB-MP is the following optimization problem. Let V be a finite ground set and f: 2V → R+ be a...
AbstractThis paper studies the partitions on which a function (μ − λ)(Π)≡∑Ni∈Π(μ−λ)(Ni) reaches a mi...
The notion of submodular partition functions generalizes many of well-known tree decompositions of g...
We investigate into the role of submodular functions in designing new heuristics and approximate alg...
AbstractWe investigate into the role of submodular functions in designing new heuristics and approxi...
AbstractThe principal partition is a decomposition of a system according to a certain very fundament...
Abstract. We consider a refinement of the partition function of graph homomor-phisms and present a q...
The problem of computing the strength and performing optimal reinforcement for an edge-weighted grap...
The Regularity Lemma of Szemerédi is a result that asserts that every graph can be par-titioned in ...
This paper presents a combinatorial polynomial-time algorithm for minimizing submolular set function...
AbstractAssume that each vertex of a graph G is assigned a nonnegative integer weight and that l and...
This paper presents the first combinatorial polynomial-time algorithm for minimizing submodular func...
We consider the problem of partitioning a graph into a non-fixed number of non-overlapping subgraphs...
AbstractAdapting the method introduced in Graph Minors X, we propose a new proof of the duality betw...
International audienceAdapting the method introduced in Graph Minors X, we propose a new proof of th...
K-WAY SUB-MP is the following optimization problem. Let V be a finite ground set and f: 2V → R+ be a...
AbstractThis paper studies the partitions on which a function (μ − λ)(Π)≡∑Ni∈Π(μ−λ)(Ni) reaches a mi...
The notion of submodular partition functions generalizes many of well-known tree decompositions of g...
We investigate into the role of submodular functions in designing new heuristics and approximate alg...
AbstractWe investigate into the role of submodular functions in designing new heuristics and approxi...
AbstractThe principal partition is a decomposition of a system according to a certain very fundament...
Abstract. We consider a refinement of the partition function of graph homomor-phisms and present a q...
The problem of computing the strength and performing optimal reinforcement for an edge-weighted grap...
The Regularity Lemma of Szemerédi is a result that asserts that every graph can be par-titioned in ...
This paper presents a combinatorial polynomial-time algorithm for minimizing submolular set function...
AbstractAssume that each vertex of a graph G is assigned a nonnegative integer weight and that l and...
This paper presents the first combinatorial polynomial-time algorithm for minimizing submodular func...
We consider the problem of partitioning a graph into a non-fixed number of non-overlapping subgraphs...
AbstractAdapting the method introduced in Graph Minors X, we propose a new proof of the duality betw...
International audienceAdapting the method introduced in Graph Minors X, we propose a new proof of th...
K-WAY SUB-MP is the following optimization problem. Let V be a finite ground set and f: 2V → R+ be a...