Perfectness and imperfectness of unit disk graphs on triangular lattice points (Q1043621): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2008.06.029 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2008.06.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2070234653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graph recognition is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5752591 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online channel allocation in FDMA networks with reuse constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph imperfection. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph imperfection. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On coloring unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient bounds for the stable set, vertex cover and set packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple heuristics for unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4504025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2758339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Channel assignment and weighted coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring proximity graphs in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: LINEAR TIME APPROXIMATION ALGORITHM FOR MULTICOLORING LATTICE GRAPHS WITH DIAGONALS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static frequency assignment in cellular networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3330973 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2008.06.029 / rank
 
Normal rank

Latest revision as of 15:00, 10 December 2024

scientific article
Language Label Description Also known as
English
Perfectness and imperfectness of unit disk graphs on triangular lattice points
scientific article

    Statements

    Perfectness and imperfectness of unit disk graphs on triangular lattice points (English)
    0 references
    0 references
    9 December 2009
    0 references
    perfect graph
    0 references
    unit disk graph
    0 references
    multicoloring
    0 references
    stable set
    0 references
    lattice graph
    0 references
    approximation algorithm
    0 references

    Identifiers