Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2014.09.024 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C22 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6378666 / rank
 
Normal rank
Property / zbMATH Keywords
 
graph algorithms
Property / zbMATH Keywords: graph algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
efficient domination
Property / zbMATH Keywords: efficient domination / rank
 
Normal rank
Property / zbMATH Keywords
 
weighted efficient domination
Property / zbMATH Keywords: weighted efficient domination / rank
 
Normal rank
Property / zbMATH Keywords
 
dually chordal graph
Property / zbMATH Keywords: dually chordal graph / rank
 
Normal rank
Property / zbMATH Keywords
 
AT-free graph
Property / zbMATH Keywords: AT-free graph / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973932399 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1410.0770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect codes in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algorithmic use of hypertree structure and maximum neighbourhood orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dually Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Edge Domination on Hole-Free Graphs in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Sets in Asteroidal Triple-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Code is \(W[1]\)-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted domination of cocomparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted independent perfect domination on cocomparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asteroidal Triple-Free 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: Q4017197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4093489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Problem Kernels for NP-Hard Problems on Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2718351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4892794 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted efficient domination problem on some perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular decomposition and transitive orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hereditary Efficiently Dominatable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplying matrices faster than coppersmith-winograd / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted perfect domination problem and its variants / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2014.09.024 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:41, 9 December 2024

scientific article
Language Label Description Also known as
English
Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
scientific article

    Statements

    Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 December 2014
    0 references
    graph algorithms
    0 references
    efficient domination
    0 references
    weighted efficient domination
    0 references
    dually chordal graph
    0 references
    AT-free graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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