The longest path problem is polynomial on cocomparability graphs (Q1939666): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-011-9583-5
@@ Property / DOI: 10.1007/s00453-011-9583-5 / rank @@
-Normal rank
@@ Property / Wikidata QID @@
+Q56639277
@@ Property / Wikidata QID: Q56639277 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear algorithm for optimal path cover problem on interval graphs
+Normal rank
@@ Property / cites work @@
+The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
+Normal rank
@@ Property / cites work @@
+Finding Hamiltonian circuits in proper interval graphs
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+On computing a longest path in a tree
@@ Property / cites work: On computing a longest path in a tree / rank @@
+Normal rank
@@ Property / cites work @@
+The Hamiltonian circuit problem for circle graphs is NP-complete
+Normal rank
@@ Property / cites work @@
+Paths in interval graphs and circular arc graphs
@@ Property / cites work: Paths in interval graphs and circular arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
+Normal rank
@@ Property / cites work @@
+Q4256006
@@ Property / cites work: Q4256006 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
+Normal rank
@@ Property / cites work @@
+Finding large cycles in Hamiltonian graphs
@@ Property / cites work: Finding large cycles in Hamiltonian graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Paths and Cycles of Superpolylogarithmic Length
+Normal rank
@@ Property / cites work @@
+Finding Long Paths, Cycles and Circuits
@@ Property / cites work: Finding Long Paths, Cycles and Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The Planar Hamiltonian Circuit Problem is NP-Complete
+Normal rank
@@ Property / cites work @@
+Algorithmic graph theory and perfect graphs
@@ Property / cites work: Algorithmic graph theory and perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the bump number is easy
@@ Property / cites work: Computing the bump number is easy / rank @@
+Normal rank
@@ Property / cites work @@
+The longest path problem has a polynomial solution on interval graphs
+Normal rank
@@ Property / cites work @@
+Hamilton Paths in Grid Graphs
@@ Property / cites work: Hamilton Paths in Grid Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On approximating the longest path in a graph
@@ Property / cites work: On approximating the longest path in a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Topics in Intersection Graph Theory
@@ Property / cites work: Topics in Intersection Graph Theory / rank @@
+Normal rank
@@ Property / cites work @@
+HAMILTONian circuits in chordal bipartite graphs
@@ Property / cites work: HAMILTONian circuits in chordal bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the Hamiltonian circuit problem on directed path graphs
+Normal rank
@@ Property / cites work @@
+Simple Geometrical Intersection Graphs
@@ Property / cites work: Simple Geometrical Intersection Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Linear structure of bipartite permutation graphs and the longest path problem
+Normal rank
@@ Property / cites work @@
+Q4952685
@@ Property / cites work: Q4952685 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for long paths in graphs
@@ Property / cites work: Algorithms for long paths in graphs / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00453-011-9583-5
@@ Property / DOI: 10.1007/S00453-011-9583-5 / rank @@
+Normal rank