Computing and listing avoidable vertices and paths (Q6185944): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-023-01168-2
+Normal rank
@@ Property / OpenAlex ID @@
+W4386420802
@@ Property / OpenAlex ID: W4386420802 / rank @@
+Normal rank
@@ Property / cites work @@
+On rigid circuit graphs
@@ Property / cites work: On rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding and counting small induced subgraphs efficiently
+Normal rank
@@ Property / cites work @@
+Vertex elimination orderings for hereditary graph classes
+Normal rank
@@ Property / cites work @@
+Separability generalizes Dirac's theorem
@@ Property / cites work: Separability generalizes Dirac's theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Graph extremities defined by search algorithms
@@ Property / cites work: Graph extremities defined by search algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
+Normal rank
@@ Property / cites work @@
+Avoidable vertices and edges in graphs
@@ Property / cites work: Avoidable vertices and edges in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Avoidable paths in graphs
@@ Property / cites work: Avoidable paths in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Shifting paths to avoidable ones
@@ Property / cites work: Shifting paths to avoidable ones / rank @@
+Normal rank
@@ Property / cites work @@
+Between<i>O</i>(<i>nm</i>) and<i>O</i>(<i>n<sup>alpha</sup></i>)
+Normal rank
@@ Property / cites work @@
+The diameter of AT‐free graphs
@@ Property / cites work: The diameter of AT‐free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fast approximation algorithms for the diameter and radius of sparse graphs
+Normal rank
@@ Property / cites work @@
+Finding a Minimum Circuit in a Graph
@@ Property / cites work: Finding a Minimum Circuit in a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+A vertex incremental approach for maintaining chordality
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+A new algorithm for optimal 2-constraint satisfaction and its implications
+Normal rank
@@ Property / cites work @@
+Complement reducible graphs
@@ Property / cites work: Complement reducible graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Recognition Algorithm for Cographs
@@ Property / cites work: A Linear Recognition Algorithm for Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+Modular decomposition and transitive orientation
@@ Property / cites work: Modular decomposition and transitive orientation / rank @@
+Normal rank
@@ Property / cites work @@
+Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
+Normal rank
@@ Property / cites work @@
+Q4252378
@@ Property / cites work: Q4252378 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum cardinality search for computing minimal triangulations of graphs
+Normal rank
@@ Property / cites work @@
+Minimal triangulations of graphs: a survey
@@ Property / cites work: Minimal triangulations of graphs: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / cites work @@
+Computing and listing avoidable vertices and paths
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6185944