On distance constrained labeling of disk graphs (Q703553): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q259035
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Fedor V. Fomin / 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.2004.06.026 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2158249986 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q60488774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501549 / 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: Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The $L(2,1)$-Labeling Problem on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line coloring of geometric intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial covers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4944992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4879166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line and first fit colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing graphs by disks and balls (a survey of recognition-complexity results) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal approximation of sparse hessians and its equivalence to a graph coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the chromatic number of the square of a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242956 / rank
 
Normal rank

Latest revision as of 17:10, 7 June 2024

scientific article
Language Label Description Also known as
English
On distance constrained labeling of disk graphs
scientific article

    Statements

    On distance constrained labeling of disk graphs (English)
    0 references
    0 references
    0 references
    0 references
    11 January 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    Disk graph
    0 references
    Labeling
    0 references
    Online
    0 references
    Approximation
    0 references
    0 references
    0 references