Independent domination in finitely defined classes of graphs: polynomial algorithms (Q2255037): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2013.08.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2502941697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting graphs for independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On algorithms for (\(P_5\), gem)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent domination in finitely defined classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On independent vertex sets in subclasses of apple-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted independent domination problem is NP-complete for chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in convex and chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the vertex packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent domination in chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On diameters and radii of bridged graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(P_{5}\)-free augmenting graphs and the maximum stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the X-join decomposition for undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding augmenting graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in extensions of 2\(K_{2}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum independent sets in subclasses of \(P_{5}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable sets in \(k\)-colorable \(P_{5}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular decomposition and transitive orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on maximum stable sets in certain \(P_{5}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximum independent sets in \(P_{5}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Dominating Sets in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satgraphs and independent domination. I / rank
 
Normal rank

Latest revision as of 15:52, 9 July 2024

scientific article
Language Label Description Also known as
English
Independent domination in finitely defined classes of graphs: polynomial algorithms
scientific article

    Statements

    Independent domination in finitely defined classes of graphs: polynomial algorithms (English)
    0 references
    0 references
    0 references
    0 references
    6 February 2015
    0 references
    independent domination
    0 references
    finitely defined class of graphs
    0 references
    polynomial-time algorithm
    0 references
    0 references
    0 references

    Identifiers