GMPLS label space minimization through hypergraph layouts (Q442249): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68M10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C39 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C65 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6064605 / rank
 
Normal rank
Property / zbMATH Keywords
 
GMPLS
Property / zbMATH Keywords: GMPLS / rank
 
Normal rank
Property / zbMATH Keywords
 
optical networks
Property / zbMATH Keywords: optical networks / rank
 
Normal rank
Property / zbMATH Keywords
 
label stacking
Property / zbMATH Keywords: label stacking / rank
 
Normal rank
Property / zbMATH Keywords
 
hypergraph layout
Property / zbMATH Keywords: hypergraph layout / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithms
Property / zbMATH Keywords: approximation algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
dynamic programming
Property / zbMATH Keywords: dynamic programming / 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.2012.01.033 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2156456181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing Hypergraph Layouts to GMPLS Routing Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: GMPLS label space minimization through hypergraph layouts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed virtual path layouts in ATM networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner problem with edge lengths 1 and 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal layouts on a chain ATM network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traveling with a Pez Dispenser (or, Routing Issues in MPLS) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biconnectivity approximations and graph carvings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258215 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:44, 5 July 2024

scientific article
Language Label Description Also known as
English
GMPLS label space minimization through hypergraph layouts
scientific article

    Statements

    GMPLS label space minimization through hypergraph layouts (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 August 2012
    0 references
    GMPLS
    0 references
    optical networks
    0 references
    label stacking
    0 references
    hypergraph layout
    0 references
    approximation algorithms
    0 references
    dynamic programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references