Pages that link to "Item:Q3740255"
From MaRDI portal
The following pages link to Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees (Q3740255):
Displaying 32 items.
- Optimal cuts and partitions in tree metrics in polynomial time (Q396629) (← links)
- On cutwidth parameterized by vertex cover (Q476444) (← links)
- Neighbourhood-width of trees (Q501055) (← links)
- Minimal trees of given search number (Q580350) (← links)
- On the k-ary hypercube (Q673771) (← links)
- A degree sequence method for the cutwidth problem of graphs (Q698370) (← links)
- On minimizing width in linear layouts (Q751660) (← links)
- Bounds on the convex label number of trees (Q1103629) (← links)
- Min Cut is NP-complete for edge weighted trees (Q1111019) (← links)
- Embedding grids into hypercubes (Q1201880) (← links)
- Search and sweep numbers of finite directed acyclic graphs (Q1208460) (← links)
- Parallel algorithms for the minimum cut and the minimum length tree layout problems (Q1391312) (← links)
- The cutwidth of trees with diameters at most 4 (Q1430969) (← links)
- Edge and node searching problems on trees (Q1575444) (← links)
- Tree-width, path-width, and cutwidth (Q1801672) (← links)
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445) (← links)
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285) (← links)
- Decomposability of a class of \(k\)-cutwidth critical graphs (Q2125221) (← links)
- Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition (Q2285134) (← links)
- Decompositions of critical trees with cutwidth \(k\) (Q2326339) (← links)
- Characterizations of \(k\)-cutwidth critical trees (Q2410043) (← links)
- On Cutwidth Parameterized by Vertex Cover (Q2891354) (← links)
- Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time (Q3057614) (← links)
- On the Cutwidth and the Topological Bandwidth of a Tree (Q3679205) (← links)
- Topological Bandwidth (Q3691781) (← links)
- (Q3725545) (← links)
- On the Cooperative Graph Searching Problem (Q5056072) (← links)
- Graph layout problems (Q5096816) (← links)
- Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs (Q5302057) (← links)
- Cutwidth II: Algorithms for partial w-trees of bounded degree (Q5462384) (← links)
- A polynomial algorithm for recognizing bounded cutwidth in hypergraphs (Q5748885) (← links)
- Efficient parallel algorithms for some tree layout problems (Q6085718) (← links)
