Pages that link to "Item:Q2465958"
From MaRDI portal
The following pages link to The path partition problem and related problems in bipartite graphs (Q2465958):
Displaying 36 items.
- An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs (Q306106) (← links)
- Blockers for the stability number and the chromatic number (Q489343) (← links)
- Complexity and approximation of the constrained forest problem (Q553340) (← links)
- On upper bounds for parameters related to the construction of special maximum matchings (Q658043) (← links)
- Heuristic approaches for the optimal wiring in large scale robotic skin design (Q1761221) (← links)
- A boundary class for the \(k\)-path partition problem (Q1791978) (← links)
- A local search algorithm for binary maximum 2-path partitioning (Q1799391) (← links)
- On maximum \(P_3\)-packing in claw-free subcubic graphs (Q2025062) (← links)
- On a relation between \(k\)-path partition and \(k\)-path vertex cover (Q2030433) (← links)
- On the isometric path partition problem (Q2042617) (← links)
- A local search 4/3-approximation algorithm for the minimum 3-path partition problem (Q2091113) (← links)
- Parameterized complexity of \((A,\ell)\)-path packing (Q2118381) (← links)
- A \(5k\)-vertex kernel for \(P_2\)-packing (Q2118855) (← links)
- Path cover problems with length cost (Q2154120) (← links)
- Induced star partition of graphs (Q2161236) (← links)
- An improved approximation algorithm for the minimum 3-path partition problem (Q2424798) (← links)
- Packing bipartite graphs with covers of complete bipartite graphs (Q2442206) (← links)
- Parameterized Complexity of $$(A,\ell )$$-Path Packing (Q5041178) (← links)
- Star Partitions of Perfect Graphs (Q5167740) (← links)
- Network-Based Vertex Dissolution (Q5254088) (← links)
- Approximation algorithms for some minimum postmen cover problems (Q5918771) (← links)
- Path cover problems with length cost (Q6069927) (← links)
- Minimum <scp>color‐degree</scp> perfect <i>b</i>‐matchings (Q6087129) (← links)
- Geodesic packing in graphs (Q6095044) (← links)
- Packing 2- and 3-stars into cubic graphs (Q6095048) (← links)
- Edge deletion to tree-like graph classes (Q6124427) (← links)
- Star covers and star partitions of double-split graphs (Q6124494) (← links)
- The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices (Q6144493) (← links)
- A local search algorithm for the \(k\)-path partition problem (Q6181375) (← links)
- Approximating the directed path partition problem (Q6204168) (← links)
- On star partition of split graphs (Q6547833) (← links)
- Star covers and star partitions of cographs and butterfly-free graphs (Q6547835) (← links)
- Approximation algorithms for covering vertices by long paths (Q6586665) (← links)
- Improved approximation algorithms for the \(k\)-path partition problem (Q6635814) (← links)
- The maximum 3-star packing problem in claw-free cubic graphs (Q6645157) (← links)
- Parameterizing path partitions (Q6664058) (← links)
