The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles (Q497683): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Luérbio Faria / rank
 
Normal rank
Property / author
 
Property / author: Jérôme Monnot / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2015.08.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1639261090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths and trails in edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness and inapproximability of convex recoloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4931752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5403027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of trails, paths and circuits in arc-colored digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of minimum convex coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Recoloring Revisited: Complexity and Exact Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex recoloring of paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for the Restricted Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On monochromatic paths in m-coloured tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex recolorings of strings and trees: Definitions, hardness results and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial convex recolorings of trees and galled networks / 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: Q4526776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matrix-based approach to searching colored paths in a weighted colored multidigraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using matrices to link conflict evolution and resolution in a graph model / rank
 
Normal rank
Property / cites work
 
Property / cites work: On monochromatic paths in edge-coloured digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on alternating cycles in edge-coloured graphs / rank
 
Normal rank

Latest revision as of 19:17, 10 July 2024

scientific article
Language Label Description Also known as
English
The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles
scientific article

    Statements

    The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 September 2015
    0 references
    edge-colored graphs
    0 references
    properly edge-colored paths
    0 references
    trails and cycles
    0 references
    monochromatic paths
    0 references
    edge-recoloring cost
    0 references

    Identifiers