Disjoint path covers joining prescribed source and sink sets in interval graphs (Q2419125): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q128589653, #quickstatements; #temporary_batch_1723714016773
 
(3 intermediate revisions by 3 users not shown)
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.2019.01.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2912114731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear algorithm for optimal path cover problem on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 1-fixed-endpoint path cover problem is Polynomial on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired many-to-many disjoint path covers of the hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths in interval graphs and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4301919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-tough cocomparability graphs are hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Comparability Graphs and of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired many-to-many disjoint path covers in faulty hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of posets and the corresponding comparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Hamiltonian circuits in interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: General-demand disjoint path covers in a graph with faulty elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2827796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore-type degree conditions for disjoint path covers in simple graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Path Cover Problems in Digraphs and Applications to Program Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for finding disjoint path covers in unit interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-many two-disjoint path covers in cylindrical and toroidal grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scattering number in graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128589653 / rank
 
Normal rank

Latest revision as of 10:46, 15 August 2024

scientific article
Language Label Description Also known as
English
Disjoint path covers joining prescribed source and sink sets in interval graphs
scientific article

    Statements

    Disjoint path covers joining prescribed source and sink sets in interval graphs (English)
    0 references
    0 references
    0 references
    0 references
    29 May 2019
    0 references
    disjoint path
    0 references
    path cover
    0 references
    path partition
    0 references
    scattering number
    0 references
    fault tolerance
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers