A linear algorithm for the group path problem on chordal graphs
www.sciencedirect.com › article › pii
The group path problem is to find a chordless path of a given weight between two given vertices. It generalizes the parity path problem considered by Hsu. We ...
We show that the recognition problem associated with the group path problem is NP-complete in general, and present an O(l i I lEl+l VI) time algorithm for the ...
Abstract. The 'two paths problem' is stated as follows. Given an undirected graph G = (V,E) and vertices s1,t1;s2,t2, the problem is to deter-.
In this note, we show how to find in time O ( k n ) an optimal colouring, a maximum independent set, a maximum clique, and an optimal clique cover of an n- ...
We present nearly optimal algorithms for certain graph problems if the input graph is given by a collection of subtrees of a tree and the subtrees are given by ...
Mar 6, 2023 · We then show that, on chordal graphs, one can solve Isometric Path Cover in linear time when the treewidth (i.e., the clique number) is ...
A chordal graph is one in which all cycles of four or more vertices have a chord, which is an edge that is not part of the cycle but connects two vertices of ...
Missing: Group | Show results with:Group
Feb 9, 2021 · This implies an O(|V | + |E|) time algorithm for checking the existence of non-separating path by doing a simple breadth first graph traversal.
The basic idea of our algorithm is to divide the input graph into subgraphs induced by subtrees of the clique tree.
Missing: Group | Show results with:Group
We consider a partitioning problem on chordal graphs that arises in the design of parallel algorithms for solving sparse triangular systems of equa- tions ...