A heuristic approach to the treedepth decomposition problem for large graphs (Q2672434): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-030-86838-3_13
+Normal rank
@@ Property / OpenAlex ID @@
+W3201541230
@@ Property / OpenAlex ID: W3201541230 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding minimum height elimination trees for interval graphs in polynomial time
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved equivalence algorithm
@@ Property / cites work: An improved equivalence algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth
+Normal rank
@@ Property / cites work @@
+Graph Bisection with Pareto-Optimization
@@ Property / cites work: Graph Bisection with Pareto-Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+On vertex rankings of graphs and its relatives
@@ Property / cites work: On vertex rankings of graphs and its relatives / rank @@
+Normal rank
@@ Property / cites work @@
+Reordering sparse matrices for parallel elimination
+Normal rank
@@ Property / cites work @@
+Sparsity. Graphs, structures, and algorithms
@@ Property / cites work: Sparsity. Graphs, structures, and algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank