Fast Sequential and Parallel Vertex Relabelings of <i>K<sub>m,m</sub></i> (Q5250275): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1142/s0129054115500021 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0129054115500021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980468504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Evaluation of General Arithmetic Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for sorting by prefix reversal / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the Edge Label Placement problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Prefix Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal edge ranking of trees in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph puzzles, homotopy, and the alternating group / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1142/S0129054115500021 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:32, 30 December 2024

scientific article; zbMATH DE number 6436987
Language Label Description Also known as
English
Fast Sequential and Parallel Vertex Relabelings of <i>K<sub>m,m</sub></i>
scientific article; zbMATH DE number 6436987

    Statements

    Fast Sequential and Parallel Vertex Relabelings of <i>K<sub>m,m</sub></i> (English)
    0 references
    19 May 2015
    0 references
    graph relabeling
    0 references
    graph algorithms
    0 references
    complexity
    0 references

    Identifiers