Pages that link to "Item:Q3922182"
From MaRDI portal
The following pages link to The NP-Completeness of Some Edge-Partition Problems (Q3922182):
Displaying 50 items.
- Parameterized complexity of \(k\)-Chinese postman problem (Q391983) (← links)
- On the complexity and algorithm of grooming regular traffic in WDM optical networks (Q436806) (← links)
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- On the complexity of deciding whether the regular number is at most two (Q497328) (← links)
- Algorithmic complexity of weakly semiregular partitioning and the representation number (Q528476) (← links)
- Approximation algorithms for grooming in optical network design (Q551206) (← links)
- The transposition median problem is NP-complete (Q631772) (← links)
- Reliable assignments of processors to tasks and factoring on matroids (Q685664) (← links)
- How to allocate review tasks for robust ranking (Q707596) (← links)
- On the complete width and edge clique cover problems (Q721937) (← links)
- Complexity of token swapping and its variants (Q722547) (← links)
- Triangle decompositions of planar graphs (Q726643) (← links)
- Embedding partial Steiner triple systems is NP-complete (Q787671) (← links)
- The complexity of completing partial Latin squares (Q793029) (← links)
- Chain packing in graphs (Q808291) (← links)
- Hardness and approximation of traffic grooming (Q837166) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Clique partitions of distance multigraphs (Q932596) (← links)
- Packing disjoint cycles over vertex cuts (Q973127) (← links)
- On packing shortest cycles in graphs (Q989491) (← links)
- Polynomial cases of graph decomposition: A complete solution of Holyer's problem (Q1024436) (← links)
- Minimum weakly fundamental cycle bases are hard to find (Q1024786) (← links)
- Covering the edges of bipartite graphs using \(K_{2,2}\) graphs (Q1041216) (← links)
- Edge decompositions into two kinds of graphs (Q1045169) (← links)
- On the complexity of partitioning graphs into connected subgraphs (Q1057062) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- The complexity of generalized clique packing (Q1073049) (← links)
- NP-completeness of graph decomposition problems (Q1179032) (← links)
- Edge-disjoint packings of graphs (Q1326750) (← links)
- On reliable graphs with static routing plans (Q1329813) (← links)
- A modified greedy heuristic for the set covering problem with improved worst case bound (Q1334632) (← links)
- A column generation approach to job grouping for flexible manufacturing systems (Q1341988) (← links)
- Clique covering and clique partition in generalizations of line graphs (Q1343162) (← links)
- Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial (Q1354723) (← links)
- The fewest clues problem (Q1623268) (← links)
- Algorithmic problems in right-angled Artin groups: complexity and applications (Q1628497) (← links)
- A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing (Q1628680) (← links)
- On some multigraph decomposition problems and their computational complexity (Q1827716) (← links)
- Packing triangles in bounded degree graphs. (Q1853132) (← links)
- Rounding in symmetric matrices and undirected graphs (Q1923592) (← links)
- The edge colorings of \(K_5\)-minor free graphs (Q2022144) (← links)
- Approximation algorithms for some min-max postmen cover problems (Q2241210) (← links)
- Computational complexity, Newton polytopes, and Schubert polynomials (Q2306519) (← links)
- Traffic grooming on the path (Q2382667) (← links)
- Colorful edge decomposition of graphs: some polynomial cases (Q2403802) (← links)
- Towards optimal kernel for edge-disjoint triangle packing (Q2446590) (← links)
- On the minimum monochromatic or multicolored subgraph partition problems (Q2456352) (← links)
- Path multicoloring with fewer colors in spiders and caterpillars (Q2460919) (← links)
- Packing triangles in low degree graphs and indifference graphs (Q2476287) (← links)
- Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees (Q2479574) (← links)
