On spectrum assignment in elastic optical tree-networks
type: Item
instance of: scholarly article
title: On spectrum assignment in elastic optical tree-networks
zbMATH Open document ID: 1407.68053
author: Jean-Claude Bermond
author: Fatima Zahra Moataz
published in: Discrete Applied Mathematics
publication date: 2019-03-11T00:00:00Z
full work available at URL: elasticDAMpreprintsubmission.pdf
Mathematics Subject Classification ID: 68M11
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 7034207
zbMATH Keywords: elastic optical networks
zbMATH Keywords: spectrum assignment
zbMATH Keywords: interval coloring
zbMATH Keywords: chordal graphs
MaRDI profile type: Publication
OpenAlex ID: W1566290388
cites work: Q2934699
cites work: OPTVersusLOADin Dynamic Storage Allocation
cites work: On some packing problem related to dynamic storage allocation
cites work: An approximation result for the interval coloring problem on claw-free chordal graphs
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: Approximation algorithms for dynamic storage allocation
cites work: Q4252403
cites work: An approximation algorithm for scheduling on three dedicated machines
cites work: Algorithmic graph theory and perfect graphs
cites work: The edge intersection graphs of paths in a tree
cites work: Edge and vertex intersection of paths in a tree
cites work: Representing edge intersection graphs of paths on degree 4 trees
cites work: Complexity of scheduling multiprocessor tasks with prespecified processors allocations
cites work: Q4472480
cites work: The Linearity of First-Fit Coloring of Interval Graphs
cites work: A polynomial time approximation algorithm for dynamic storage allocation
cites work: Computing and Combinatorics
cites work: Intersection graphs of paths in a tree
cites work: Approximating interval coloring and max-coloring in chordal graphs
cites work: On the interval chromatic number of proper interval graphs
cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
Wikidata QID: Q129022372
DOI: 10.1016/J.DAM.2018.09.021
description: scientific article; zbMATH DE number 7034207