Exact approaches for the orderly colored longest path problem: performance comparison (Q1628069): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Cycles and paths in edge‐colored graphs with given degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the heaviest \(k\)-subgraph / 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: The rainbow spanning forest problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian circuits determining the order of chromosomes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properly colored paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dirac Type Condition for Properly Coloured Paths and Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Edge-Colored Version of Dirac's Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Minimum Cut-Sets and <i>b</i>-Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA physical mapping and alternating Eulerian cycles in colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Orderly Colored Longest Path Problem – a survey of applications and new algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal pathway reconstruction on 3D NMR maps / rank
 
Normal rank

Revision as of 13:07, 17 July 2024

scientific article
Language Label Description Also known as
English
Exact approaches for the orderly colored longest path problem: performance comparison
scientific article

    Statements

    Identifiers