A polynomial algorithm for weighted scattering number in interval graphs (Q2422741): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.dam.2019.01.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2912539891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing tough graphs is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / 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: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scattering number and modular decomposition / 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: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / 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: One-dimensional logic gate assignment and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3428636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Scattering Number of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between scattering number and other vulnerability parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scattering number in graphs / rank
 
Normal rank

Latest revision as of 15:11, 19 July 2024

scientific article
Language Label Description Also known as
English
A polynomial algorithm for weighted scattering number in interval graphs
scientific article

    Statements

    A polynomial algorithm for weighted scattering number in interval graphs (English)
    0 references
    0 references
    0 references
    0 references
    20 June 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    scattering number
    0 references
    weighted scattering number
    0 references
    toughness
    0 references
    network vulnerability
    0 references
    interval graph
    0 references
    local cut
    0 references
    0 references