Results 1  10
of
31
Permanents, Pfaffian Orientations, and Even Directed Circuits
, 1999
"... Given a 01 square matrix A, when can some of the 1’s be changed to −1’s in such a way that the permanent of A equals the determinant of the modified matrix? When does a real square matrix have the property that every real matrix with the same sign pattern (that is, the corresponding entries either ..."
Abstract

Cited by 57 (13 self)
 Add to MetaCart
Given a 01 square matrix A, when can some of the 1’s be changed to −1’s in such a way that the permanent of A equals the determinant of the modified matrix? When does a real square matrix have the property that every real matrix with the same sign pattern (that is, the corresponding entries either have the same sign, or are both zero) is nonsingular? When is a hypergraph with n vertices and n hyperedges minimally nonbipartite? When does a bipartite graph have a “Pfaffian orientation”? Given a digraph, does it have no directed circuit of even length? Given a digraph, does it have a subdivision with no even directed circuit? It is known that all the above problems are equivalent. We prove a structural characterization of the feasible instances, which implies a polynomialtime algorithm to solve all of the above problems. The structural characterization says, roughly speaking, that a bipartite graph has a Pfaffian orientation if and only if it can be obtained by piecing together (in a specified way) planar bipartite graphs and one sporadic nonplanar bipartite graph.
Approximation Algorithms for Classes of Graphs Excluding SingleCrossing Graphs as Minors
"... Many problems that are intractable for general graphs allow polynomialtime solutions for structured classes of graphs, such as planar graphs and graphs of bounded treewidth. ..."
Abstract

Cited by 25 (16 self)
 Add to MetaCart
Many problems that are intractable for general graphs allow polynomialtime solutions for structured classes of graphs, such as planar graphs and graphs of bounded treewidth.
A New Planarity Test
, 1999
"... Given an undirected graph, the planarity testing problem is to determine whether the graph can be drawn in the plane without any crossing edges. Linear time planarity testing algorithms have previously been designed by Hopcroft and Tarjan, and by Booth and Lueker. However, their approaches are quite ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
Given an undirected graph, the planarity testing problem is to determine whether the graph can be drawn in the plane without any crossing edges. Linear time planarity testing algorithms have previously been designed by Hopcroft and Tarjan, and by Booth and Lueker. However, their approaches are quite involved. Several other approaches have also been developed for simplifying the planariy test. In this paper, we developed a very simple linear time testing algorithm based only on a depthfirst search tree. When the given graph is not planar, our algorithm immediately produces explicit Kuratowski's subgraphs. A new data structure, PCtrees, is introduced, which can be viewed as abstract subembeddings of actual planar embeddings. A graphreduction technique is adopted so that the embeddings for the planar biconnected components constructed at each iteration never have to be changed. The recognition and embedding are actually done simultaneously in our algorithm 1 . The implementation of o...
Radial Level Planarity Testing and Embedding in Linear Time
 Journal of Graph Algorithms and Applications
, 2005
"... A graph with a given partition of the vertices on k concentric circles is radial level planar if there is a vertex permutation such that the edges can be routed strictly outwards without crossings. Radial level planarity extends level planarity, where the vertices are placed on k horizontal lines an ..."
Abstract

Cited by 19 (9 self)
 Add to MetaCart
A graph with a given partition of the vertices on k concentric circles is radial level planar if there is a vertex permutation such that the edges can be routed strictly outwards without crossings. Radial level planarity extends level planarity, where the vertices are placed on k horizontal lines and the edges are routed strictly downwards without crossings. The extension is characterised by rings, which are level nonplanar biconnected components. Our main results are linear time algorithms for radial level planarity testing and for computing an embedding. We introduce PQRtrees as a new data structure where Rnodes and associated templates for their manipulation are introduced to deal with rings. Our algorithms extend level planarity testing and embedding algorithms which use PQtrees.
Graph and map isomorphism and all polyhedral embeddings in linear time
 In Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC
, 2008
"... For every surface S (orientable or nonorientable), we give a linear time algorithm to test the graph isomorphism of two graphs, one of which admits an embedding of facewidth at least 3 into S. This improves a previously known algorithm whose time complexity is n O(g),wheregis the genus of S. This ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
For every surface S (orientable or nonorientable), we give a linear time algorithm to test the graph isomorphism of two graphs, one of which admits an embedding of facewidth at least 3 into S. This improves a previously known algorithm whose time complexity is n O(g),wheregis the genus of S. This is the first algorithm for which the degree of polynomial in the time complexity does not depend on g. The above result is based on two linear time algorithms, each of which solves a problem that is of independent interest. The first of these problems is the following one. Let S beafixedsurface. GivenagraphG andanintegerk≥3, we want to find an embedding of G in S of facewidth at least k, or conclude that such an embedding does not exist. It is known that this problem is NPhard when the surface is not fixed. Moreover, if there is an embedding, the algorithm can give all embeddings of facewidth at least k, up to Whitney equivalence. Here, the facewidth of an embedded graph G is the minimum number of points of G in which some noncontractible closed curve in the surface intersects the graph. In the proof of the above algorithm, we give a simpler proof and a better bound for the theorem by Mohar and Robertson concerning the number of polyhedral embeddings of 3connected graphs.
1.5Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
 IN THE 5TH INTERNATIONAL WORKSHOP ON APPROXIMATION ALGORITHMS FOR COMBINATORIAL OPTIMIZATION (ITALY, APPROX 2002), LNCS, 2002
, 2002
"... We give polynomialtime constantfactor approximation algorithms for the treewidth and branchwidth of any Hminorfree graph for a given graph H with crossing number at most 1. The approximation factors are 1.5 for treewidth and 2.25 for branchwidth. In particular, our result directly applies to ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
We give polynomialtime constantfactor approximation algorithms for the treewidth and branchwidth of any Hminorfree graph for a given graph H with crossing number at most 1. The approximation factors are 1.5 for treewidth and 2.25 for branchwidth. In particular, our result directly applies to classes of nonplanar graphs such as K5minor free graphs and K3,3minorfree graphs. Along the way, we present a polynomialtime algorithm to decompose Hminorfree graphs into planar graphs and graphs of treewidth at most cH (a constant dependent on H) using clique sums. This result has several applications in designing fully polynomialtime approximation schemes and fixedparameter algorithms for many NPcomplete problems on these graphs.
From Algorithms to Working Programs On the Use of Program Checking in LEDA
 IN PROC. INT. CONF. ON MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE (MFCS 98
, 1998
"... We report on the use of program checking in the LEDA library of efficient data types and algorithms. ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
We report on the use of program checking in the LEDA library of efficient data types and algorithms.
Graph Minors and Graphs on Surfaces
, 2001
"... Graph minors and the theory of graphs embedded in surfaces are ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
Graph minors and the theory of graphs embedded in surfaces are
Elimination of local bridges
 Math. Slovaca
, 1997
"... Let K be a subgraph of G. It is shown that if G is 3–connected modulo K then it is possible to replace branches of K by other branches joining same pairs of main vertices of K such that G has no local bridges with respect to the new subgraph K. A linear time algorithm is presented that either perfor ..."
Abstract

Cited by 8 (8 self)
 Add to MetaCart
Let K be a subgraph of G. It is shown that if G is 3–connected modulo K then it is possible to replace branches of K by other branches joining same pairs of main vertices of K such that G has no local bridges with respect to the new subgraph K. A linear time algorithm is presented that either performs such a task, or finds a Kuratowski subgraph K5 or K3,3 in a subgraph of G formed by a branch e and local bridges on e. This result is needed in linear time algorithms for embedding graphs in surfaces.
Universal obstructions for embedding extension problems
"... Let K be an induced nonseparating subgraph of a graph G, andletB be the bridge of K in G. Obstructions for extending a given 2cell embedding of K to an embedding of G in the same surface are considered. It is shown that it is possible to find a nice obstruction which means that it has bounded bran ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
Let K be an induced nonseparating subgraph of a graph G, andletB be the bridge of K in G. Obstructions for extending a given 2cell embedding of K to an embedding of G in the same surface are considered. It is shown that it is possible to find a nice obstruction which means that it has bounded branch size up to a bounded number of “almost disjoint ” millipedes. Moreover, B contains a nice subgraph ˜ B with the following properties. If K is 2cell embedded in some surface and F is a face of K, then ˜ B admits exactly the same types of embeddings in F as B. A linear time algorithm to construct such a universal obstruction ˜ B is presented. At the same time, for every type of embeddings of ˜ B, an embedding of B ofthesametypeis determined.