The minimum vulnerability problem on specific graph classes (Q346526): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 90C35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C27
@@ Property / Mathematics Subject Classification ID: 90C27 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6657326
@@ Property / zbMATH DE Number: 6657326 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+bounded treewidth graph
@@ Property / zbMATH Keywords: bounded treewidth graph / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+chordal graph
@@ Property / zbMATH Keywords: chordal graph / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+fixed parameter tractability
@@ Property / zbMATH Keywords: fixed parameter tractability / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+graph algorithm
@@ Property / zbMATH Keywords: graph algorithm / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+minimum vulnerability problem
@@ Property / zbMATH Keywords: minimum vulnerability problem / rank @@
+Normal rank
@@ 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/s10878-015-9950-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2178803989
@@ Property / OpenAlex ID: W2178803989 / rank @@
+Normal rank
@@ Property / cites work @@
+The Minimum Vulnerability Problem on Graphs
@@ Property / cites work: The Minimum Vulnerability Problem on Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Minimum Vulnerability Problem
@@ Property / cites work: The Minimum Vulnerability Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+On network design problems: fixed cost flows and the covering steiner problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The intersection graphs of subtrees in trees are exactly the chordal graphs
+Normal rank
@@ Property / cites work @@
+Beyond the flow decomposition barrier
@@ Property / cites work: Beyond the flow decomposition barrier / rank @@
+Normal rank
@@ Property / cites work @@
+A POLYNOMIAL-TIME ALGORITHM FOR FINDING TOTAL COLORINGS OF PARTIAL k-TREES
+Normal rank
@@ Property / cites work @@
+Q4494412
@@ Property / cites work: Q4494412 / rank @@
+Normal rank
@@ Property / cites work @@
+The edge-disjoint paths problem is NP-complete for series-parallel graphs
+Normal rank
@@ Property / cites work @@
+Finding paths with minimum shared edges
@@ Property / cites work: Finding paths with minimum shared edges / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient graph representations
@@ Property / cites work: Efficient graph representations / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:346526