A linear algorithm for the group path problem on chordal graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4117882
- An algorithm for packing non-zero \(A\)-paths in group-labelled graphs
- The parity path problem on some subclasses of perfect graphs
- Finding a shortest non-zero path in group-labeled graphs via permanent computation
- On the extension of bipartite to parity graphs
Cites work
- A linear algorithm for the group path problem on chordal graphs
- Decomposition by clique separators
- Domination, independent domination, and duality in strongly chordal graphs
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- On the complexity of testing for odd holes and induced odd paths
Cited in
(11)- An improved algorithm for the longest induced path problem on \(k\)-chordal graphs
- Even and odd pairs in comparability and in P₄-comparability graphs
- A polynomial algorithm for the parity path problem on perfectly orientable graphs
- Intersection graphs of Helly families of subtrees
- The parity path problem on some subclasses of perfect graphs
- Finding induced paths of given parity in claw-free graphs
- Large Induced Subgraphs via Triangulations and CMSO
- Intersection graphs of proper subtrees of unicyclic graphs
- Finding an induced path of given parity in planar graphs in polynomial time
- A linear algorithm for the group path problem on chordal graphs
- Efficient reduction for path problems on circular-arc graphs
This page was built for publication: A linear algorithm for the group path problem on chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686257)
