On the complexity of rainbow spanning forest problem (Q1749772): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11590-017-1161-6 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-017-1161-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2664277112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with many or few colors in edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicolored forests in complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of rainbow spanning forest problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The labeled maximum matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Carousel greedy: a generalized greedy algorithm with applications in optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: OMEGA one multi ethnic genetic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle-ID sensor location for route flow recognition: models and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum labeling spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighbourhood search for the minimum labelling Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete particle swarm optimization for the minimum labelling Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum label spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum monochromatic or multicolored subgraph partition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rainbow Cycle Cover Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Colorful Traveling Salesman Problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11590-017-1161-6 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:04, 11 December 2024

scientific article
Language Label Description Also known as
English
On the complexity of rainbow spanning forest problem
scientific article

    Statements

    On the complexity of rainbow spanning forest problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 May 2018
    0 references
    graph theory
    0 references
    edge-colored graph
    0 references
    rainbow components
    0 references
    approximation algorithm
    0 references

    Identifiers