Add to ORKGWe present a decomposition strategy for c-nets, i.\,e., rooted 3-connected planar maps. The decomposition yields an algebraic equation for the number of c-nets with a given number of vertices and a given size of the outer face. The decomposition also leads to a deterministic and polynomial time algorithm to sample c-nets \emph{uniformly at random}. Using rejection sampling, we can also sample isomorphism types of convex polyhedra, i.e., 3-connected planar graphs, uniformly at random
In this paper we introduce a generalization of the c-planarity testing problem for clustered graphs....
The goal of our work is to analyze random cubic planar graphs according to the uniform distribution....
We generalize the strong Hanani–Tutte theorem to clustered graphs with two disjoint clus-ters, and s...
We present a decomposition strategy for c-nets, i.\,e., rooted 3-connected planar maps. The decompos...
In this thesis an algorithm for sampling rooted 3-connected planar graphs (c-nets) in deterministic ...
We present a deterministic polynomial time algorithm to sample a labeled planar graph uniformly at r...
Data is presented on the number of 3-connected planar graphs, isomorphic to the graphs of convex pol...
AbstractWe present a deterministic polynomial time algorithm to sample a labeled planar graph unifor...
(eng) I present an efficient algorithm which lists the minimal separators of a 3-connected planar gr...
International audienceWe present an efficient algorithm that lists the minimal separators of a 3-con...
AbstractWe present an efficient algorithm that lists the minimal separators of a 3-connected planar ...
We present several polynomial-time algorithms for c-planarity testing for cluster hierarchy C contai...
This is a survey on methods to construct a three-dimensional convex polytope with a given combinator...
An efficient algorithm is presented for determing if a given graph is planar. Algorithm 1 is to test...
This thesis describes algorithms on planar maps (graphs embedded in the plane without edge-crossings...
In this paper we introduce a generalization of the c-planarity testing problem for clustered graphs....
The goal of our work is to analyze random cubic planar graphs according to the uniform distribution....
We generalize the strong Hanani–Tutte theorem to clustered graphs with two disjoint clus-ters, and s...
We present a decomposition strategy for c-nets, i.\,e., rooted 3-connected planar maps. The decompos...
In this thesis an algorithm for sampling rooted 3-connected planar graphs (c-nets) in deterministic ...
We present a deterministic polynomial time algorithm to sample a labeled planar graph uniformly at r...
Data is presented on the number of 3-connected planar graphs, isomorphic to the graphs of convex pol...
AbstractWe present a deterministic polynomial time algorithm to sample a labeled planar graph unifor...
(eng) I present an efficient algorithm which lists the minimal separators of a 3-connected planar gr...
International audienceWe present an efficient algorithm that lists the minimal separators of a 3-con...
AbstractWe present an efficient algorithm that lists the minimal separators of a 3-connected planar ...
We present several polynomial-time algorithms for c-planarity testing for cluster hierarchy C contai...
This is a survey on methods to construct a three-dimensional convex polytope with a given combinator...
An efficient algorithm is presented for determing if a given graph is planar. Algorithm 1 is to test...
This thesis describes algorithms on planar maps (graphs embedded in the plane without edge-crossings...
In this paper we introduce a generalization of the c-planarity testing problem for clustered graphs....
The goal of our work is to analyze random cubic planar graphs according to the uniform distribution....
We generalize the strong Hanani–Tutte theorem to clustered graphs with two disjoint clus-ters, and s...