Graph classes with structured neighborhoods and algorithmic applications (Q392023): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2013.01.011 / 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.2013.01.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964095725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees / 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: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs / 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: Q4427278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence and domination in polygon graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing role assignments of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms on circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominations in trapezoid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(N + M)$-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for the dominating set problem on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean-width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-width and well-quasi-ordering in matroids and graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / 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 recognition of circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm to recognize circular permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 2-Chain Subgraph Cover and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth and Minimum Fill-in on d-Trapezoid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Partial Order Dimension Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hardness of Approximating Poset Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring the vulnerability for classes of intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polygon Graph Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition algorithms for orders of small width and graphs of small Dilworth number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rank-Width of the Square Grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering and domination in perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted domination of cocomparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of domination problems in circle graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2013.01.011 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:13, 9 December 2024

scientific article
Language Label Description Also known as
English
Graph classes with structured neighborhoods and algorithmic applications
scientific article

    Statements

    Graph classes with structured neighborhoods and algorithmic applications (English)
    0 references
    0 references
    0 references
    13 January 2014
    0 references
    graph decomposition
    0 references
    graph classes
    0 references
    vertex partitioning problems
    0 references
    Boolean width
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references