Partitioning graphs into connected parts (Q1034603): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(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.2009.06.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4213168420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contractibility and NP-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving connected dominating set faster than \(2^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stable set problem in special \(P_{5}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new characterization of \(P_{6}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable sets in certain \(P_6\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2770587 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:59, 2 July 2024

scientific article
Language Label Description Also known as
English
Partitioning graphs into connected parts
scientific article

    Statements

    Partitioning graphs into connected parts (English)
    0 references
    0 references
    0 references
    0 references
    6 November 2009
    0 references
    graph partition
    0 references
    edge contraction
    0 references
    path
    0 references
    exact algorithm
    0 references

    Identifiers