An optimal embedding of cycles into incomplete hypercubes (Q1607026): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q127472894, #quickstatements; #temporary_batch_1722442319438
 
(2 intermediate revisions by 2 users not shown)
Property / cites work
 
Property / cites work: Embedding graphs onto the Supercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding cycles in IEH graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding of cycles in arrangement graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding cycles and meshes onto incomplete hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: EMBEDDINGS OF COMPLETE BINARY TREES INTO EXTENDED GRIDS WITH EDGE-CONGESTION 1∗ / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the embedding of cycles in pancake graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of congestion-1 embedding in a hypercube / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(99)00139-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2035106515 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127472894 / rank
 
Normal rank

Latest revision as of 18:15, 31 July 2024

scientific article
Language Label Description Also known as
English
An optimal embedding of cycles into incomplete hypercubes
scientific article

    Statements