Algorithms and Computation
From MaRDI portal
Publication:5712173
DOI10.1007/b104582zbMath1116.05318MaRDI QIDQ5712173
Publication date: 22 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b104582
68Q25: Analysis of algorithms and problem complexity
05C38: Paths and cycles
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Transversals of longest paths, An approximation algorithm for the longest cycle problem in solid grid graphs, The longest path problem has a polynomial solution on interval graphs, \(L(2,1)\)-labeling of perfect elimination bipartite graphs, The longest path problem is polynomial on cocomparability graphs, Linear structure of bipartite permutation graphs and the longest path problem, Computing and counting longest paths on circular-arc graphs in polynomial time, Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time, The Longest Path Problem is Polynomial on Cocomparability Graphs, A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs, The Longest Path Problem Is Polynomial on Interval Graphs