The following pages link to (Q4659605):
Displaying 32 items.
- Rainbow \(C_4\)'s and directed \(C_4\)'s: the bipartite case study (Q262974) (← links)
- Traveling salesman problems in temporal graphs (Q284573) (← links)
- The maximum labeled path problem (Q527429) (← links)
- Approximation and hardness results for label cut and related problems (Q630189) (← links)
- On the hardness of labeled correlation clustering problem: a parameterized complexity view (Q896155) (← links)
- Rainbow cycles in edge-colored graphs (Q906488) (← links)
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (Q1014813) (← links)
- The labeled perfect matching in bipartite graphs (Q1044711) (← links)
- Binary constraint satisfaction problems defined by excluded topological minors (Q1633806) (← links)
- Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem (Q1702134) (← links)
- A note on heterochromatic \(C_4\) in edge-colored triangle-free graphs (Q1928290) (← links)
- Labeled traveling salesman problems: complexity and approximation (Q1952507) (← links)
- The parameterized complexity of some minimum label problems (Q1959420) (← links)
- A dynamic programming algorithm for solving the \(k\)-color shortest path problem (Q2047192) (← links)
- Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs (Q2057600) (← links)
- An exact reduction technique for the k-colour shortest path problem (Q2108122) (← links)
- Note on rainbow triangles in edge-colored graphs (Q2117536) (← links)
- Complexity and approximation results on the shared transportation problem (Q2149862) (← links)
- Improved approximation bounds for the minimum constraint removal problem (Q2206735) (← links)
- Minimum label \(s\)-\(t\) cut has large integrality gaps (Q2216106) (← links)
- Algorithms and complexity results for labeled correlation clustering problem (Q2253964) (← links)
- Approximate tradeoffs on weighted labeled matroids (Q2341761) (← links)
- Finding disjoint paths in networks with star shared risk link groups (Q2344758) (← links)
- Zeons, orthozeons, and graph colorings (Q2361423) (← links)
- On sufficient conditions for rainbow cycles in edge-colored graphs (Q2421861) (← links)
- Approximation algorithms and hardness results for labeled connectivity problems (Q2426652) (← links)
- On the minimum monochromatic or multicolored subgraph partition problems (Q2456352) (← links)
- Minimum Cell Connection in Line Segment Arrangements (Q3132917) (← links)
- Sequence Hypergraphs (Q3181065) (← links)
- An Introduction to Temporal Graphs: An Algorithmic Perspective (Q3464477) (← links)
- The Complexity of Bottleneck Labeled Graph Problems (Q3508579) (← links)
- (Q5009492) (← links)
