Fast Exact Algorithm for L(2,1)-Labeling of Graphs (Q3010388): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Peter Rossmanith / rank
Normal rank
 
Property / author
 
Property / author: Peter Rossmanith / 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.1007/978-3-642-20877-5_9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2096623634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for  -Colorings of Graphs / 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: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter complexity of \(\lambda\)-labelings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally constrained graph homomorphisms -- structure, complexity, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph labellings with variable weights, a survey / 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: A Linear Time Algorithm for L(2,1)-Labeling of Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for \(L(2,1)\)-labeling of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Improved Exact Algorithms for L(2,1)-Labeling of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Channel Assignment Problem with Variable Weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms for L(2,1)-Labeling of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on labeling graphs with a condition at distance two / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:45, 4 July 2024

scientific article
Language Label Description Also known as
English
Fast Exact Algorithm for L(2,1)-Labeling of Graphs
scientific article

    Statements

    Fast Exact Algorithm for L(2,1)-Labeling of Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 July 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references