AbstractWe show that the Min Cut Linear Arrangement Problem (Min Cut) is NP-complete for trees with polynomial size edge weights and derive from this the NP-completeness of Min Cut for planar graphs with maximum vertex degree 3. This is used to show the NP-completeness of Search Number, Vertex Separation, Progressive Black/White Pebble Demand, and Topological Bandwidth for planar graphs with maximum vertex degree 3
Abstract. Graph packing and partitioning problems have been studied in many contexts, includ-ing fro...
Algorithms are presented for the all-pairs min-cut problem in bounded tree-width, planar and sparse ...
In this paper we look at several well known layout problems. We show that MINCUT layout and Topologi...
AbstractWe show that the Min Cut Linear Arrangement Problem (Min Cut) is NP-complete for trees with ...
• G = (V,E) is an undirected graph. • A cut (S, T) is a partition of V. • A cut edge is an edge with...
The traditional min-cut problem involves finding a cut with minimum weight between two specified ver...
AbstractIt is widely believed that showing a problem to be NP-complete is tantamount to proving its ...
We show that the minimumcut problem for weighted undirected graphs can be solved in NC using three s...
[[abstract]]The real-weight maximum cut of a planar graph is considered. Given an undirected planar ...
A min-max theorem is developed for the multiway cut problem of edge-weighted trees. We present a pol...
International audienceThe problem of finding a disconnected cut in a graph is NP-hard in general but...
This report presents research into a fundamentally new approach to finding all pairwise minimum cuts...
The minimum cut and minimum sum linear arrangement problems usually occur in solving wiring problems...
Generalizing the cost in the standard min-cut problem to a submodular cost function immediately make...
Abstract. Graph packing and partitioning problems have been studied in many contexts, includ-ing fro...
Abstract. Graph packing and partitioning problems have been studied in many contexts, includ-ing fro...
Algorithms are presented for the all-pairs min-cut problem in bounded tree-width, planar and sparse ...
In this paper we look at several well known layout problems. We show that MINCUT layout and Topologi...
AbstractWe show that the Min Cut Linear Arrangement Problem (Min Cut) is NP-complete for trees with ...
• G = (V,E) is an undirected graph. • A cut (S, T) is a partition of V. • A cut edge is an edge with...
The traditional min-cut problem involves finding a cut with minimum weight between two specified ver...
AbstractIt is widely believed that showing a problem to be NP-complete is tantamount to proving its ...
We show that the minimumcut problem for weighted undirected graphs can be solved in NC using three s...
[[abstract]]The real-weight maximum cut of a planar graph is considered. Given an undirected planar ...
A min-max theorem is developed for the multiway cut problem of edge-weighted trees. We present a pol...
International audienceThe problem of finding a disconnected cut in a graph is NP-hard in general but...
This report presents research into a fundamentally new approach to finding all pairwise minimum cuts...
The minimum cut and minimum sum linear arrangement problems usually occur in solving wiring problems...
Generalizing the cost in the standard min-cut problem to a submodular cost function immediately make...
Abstract. Graph packing and partitioning problems have been studied in many contexts, includ-ing fro...
Abstract. Graph packing and partitioning problems have been studied in many contexts, includ-ing fro...
Algorithms are presented for the all-pairs min-cut problem in bounded tree-width, planar and sparse ...
In this paper we look at several well known layout problems. We show that MINCUT layout and Topologi...
DOI
Add to ORKG