Pages that link to "Item:Q4210669"
From MaRDI portal
The following pages link to Spanning trees with many or few colors in edge-colored graphs (Q4210669):
Displayed 31 items.
- Traveling salesman problems in temporal graphs (Q284573) (← links)
- Edge-disjoint rainbow spanning trees in complete graphs (Q298338) (← links)
- Lower and upper bounds for the spanning tree with minimum branch vertices (Q377727) (← links)
- Computational complexity analysis of the sensor location flow observability problem (Q479256) (← links)
- The maximum labeled path problem (Q527429) (← links)
- Approximation and hardness results for label cut and related problems (Q630189) (← links)
- Bounded-degree spanning tree problems: models and new algorithms (Q632386) (← links)
- Greedy approximation for the minimum connected dominating set with labeling (Q828691) (← links)
- On the complexity of graph self-assembly in accretive systems (Q934978) (← links)
- The labeled maximum matching problem (Q1000970) (← links)
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (Q1014813) (← links)
- The labeled perfect matching in bipartite graphs (Q1044711) (← links)
- Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem (Q1702134) (← links)
- On the complexity of rainbow spanning forest problem (Q1749772) (← links)
- Labeled traveling salesman problems: complexity and approximation (Q1952507) (← links)
- The parameterized complexity of some minimum label problems (Q1959420) (← links)
- Algorithms and complexity for a class of combinatorial optimization problems with labelling (Q2031932) (← links)
- Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes (Q2067494) (← links)
- The salesman's improved tours for fundamental classes (Q2227538) (← links)
- Approximate tradeoffs on weighted labeled matroids (Q2341761) (← links)
- Approximation algorithms and hardness results for labeled connectivity problems (Q2426652) (← links)
- Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours (Q2687058) (← links)
- Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem (Q3439489) (← links)
- An Introduction to Temporal Graphs: An Algorithmic Perspective (Q3464477) (← links)
- The Complexity of Bottleneck Labeled Graph Problems (Q3508579) (← links)
- The complexity for partitioning graphs by monochromatic trees, cycles and paths (Q4652867) (← links)
- Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees (Q5139656) (← links)
- An Introduction to Temporal Graphs: An Algorithmic Perspective<sup>*</sup> (Q5856438) (← links)
- Maximum cuts in edge-colored graphs (Q5918845) (← links)
- The complexity of bottleneck labeled graph problems (Q5961969) (← links)
- Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs (Q6100615) (← links)