scientific article; zbMATH DE number 15260
From MaRDI portal
Publication:3977585
zbMATH Open0747.05093MaRDI QIDQ3977585FDOQ3977585
Authors: J. Richard Lundgren, Craig Rasmussen, John S. Maybee 
Publication date: 25 June 1992
Title of this publication is not available (Why is that?)
Recommendations
- \(T\)-graphs and the channel assignment problem
- A graph theoretic approach for channel assignment in cellular networks
- scientific article; zbMATH DE number 3873389
- scientific article; zbMATH DE number 3912431
- Graph imperfection and channel assignment
- Graph-Theoretic Concepts in Computer Science
- Channel assignment on graphs of bounded treewidth
- An Asymptotic Approach to the Channel Assignment Problem
- An approximation algorithm for channel assignment with certain constraints
Coloring of graphs and hypergraphs (05C15) Applications of graph theory to circuits and networks (94C15) Graph theory (05C99) Channel models (including quantum) in information and communication theory (94A40)
Cited In (8)
- Interval competition graphs of symmetric digraphs
- Two-step graphs of trees
- A competitive scheduling problem and its relevance to UMTS channel assignment
- Characterization of digraphs with equal domination graphs and underlying graphs
- \((i,j)\) competition graphs
- A characterization of graphs with interval two-step graphs
- A graph theoretic approach to the slot allocation problem
- Chromatic numbers of competition graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3977585)
