Approximating the bandwidth of caterpillars (Q2391175): 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/s00453-007-9002-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2180413174
@@ Property / OpenAlex ID: W2180413174 / rank @@
+Normal rank
@@ Property / cites work @@
+The bandwidth problem for graphs and matrices—a survey
+Normal rank
@@ Property / cites work @@
+Graphs with small bandwidth and cutwidth
@@ Property / cites work: Graphs with small bandwidth and cutwidth / rank @@
+Normal rank
@@ Property / cites work @@
+Q4780797
@@ Property / cites work: Q4780797 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the bandwidth via volume respecting embeddings
+Normal rank
@@ Property / cites work @@
+Q2721963
@@ Property / cites work: Q2721963 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Bandwidth Approximation for Trees and Chordal Graphs
+Normal rank
@@ Property / cites work @@
+Bandwidth Minimization: An approximation algorithm for caterpillars
+Normal rank
@@ Property / cites work @@
+Measured descent: A new embedding method for finite metrics
+Normal rank
@@ Property / cites work @@
+The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
+Normal rank
@@ Property / cites work @@
+Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2391175