Corpus ID: 231573069

Shortest non-separating st-path on chordal graphs

  title={Shortest non-separating st-path on chordal graphs},
  author={Xiao Mao},
  • Xiao Mao
  • Published 2021
  • Computer Science
  • ArXiv
Many NP-Hard problems on general graphs, such as maximum independence set, maximal cliques and graph coloring can be solved efficiently on chordal graphs. In this paper, we explore the problem of non-separating st-paths defined on edges: for a connected undirected graph and two vertices, a nonseparating path is a path between the two vertices such that if we remove all the edges on the path, the graph remains connected. We show that on general graphs, checking the existence of non-separating… Expand

Figures from this paper


Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs
  • B. Wu
  • Computer Science, Mathematics
  • J. Comb. Optim.
  • 2013
This paper presents an algorithm in time O(NlogN) for finding a minimum weight non-separating path between two given nodes in a grid graph of N nodes with positive weight, and develops an exact algorithm for the BCP2 problem on grid graphs. Expand
Graph Connectivity After Path Removal
The purpose of this paper is to study the number of nonseparating u—v path for two arbitrary vertices u and v of a given graph and it is proved that if G is a 5-connected graph, then for every pair of vertices U and v there exists a path P[u, v] such that G—V(P[ u, v]) is 2-connected. Expand
Algorithmic Aspects of Vertex Elimination on Graphs
A graph-theoretic elimination process which is related to performing Gaussian elimination on sparse symmetric positive definite systems of linear equations is considered, and it is conjecture that the problem of finding a minimum ordering is NP-complete. Expand
The intersection graphs of subtrees in tree are exactly the chordal graphs
The intersection graph of a family of subtrees in an undirected tree is called a subtree graph. A graph is called chordal if every simple circuit with more than three vertices has an edge connectingExpand
Non-Separating Paths in 4-Connected Graphs
Abstract.In 1975, Lovász conjectured that for any positive integer k, there exists a minimum positive integer f(k) such that, for any two vertices x, y in any f(k)-connected graph G, there is a pathExpand
A note on two problems in connexion with graphs
  • E. Dijkstra
  • Mathematics, Computer Science
  • Numerische Mathematik
  • 1959
A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given. Expand
Highly linked graphs
It is shown here that k (G)≥22k will do and that a graphG isk-linked provided its vertex connectivityk(G) exceeds 10k\sqrt {\log _2 k}$$ . Expand
We give an overview of Tutte’s paper, “How to draw a graph”, that contains: (i) a proof that every simple 3-connected planar graph admits a straight-line embedding in the plane such that each faceExpand
A weaker version of Lovász' path removal conjecture
We prove there exists a function f(k) such that for every f(k)-connected graph G and for every edge [email protected]?E(G), there exists an induced cycle C containing e such that G-E(C) isExpand
The complexity of theorem-proving procedures
  • S. Cook
  • Computer Science, Mathematics
  • STOC
  • 1971
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is aExpand