Hypergraph theory in wireless communication networks
cellular networkcross-cell D2D communicationD2D communicationgraph theoryhypergraph clusteringhypergraph coloringhypergraphswireless communication
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Hypergraphs (05C65) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Applications of graph theory (05C90) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Communication networks in operations research (90B18) Communication theory (94A05)
- Hypergraph theory. An introduction
- Graph domination, coloring and cliques in telecommunications
- Graph-Theoretic Concepts in Computer Science
- Hypergraph modeling and approximation algorithms for the minimum length link scheduling in multiuser MIMO networks
- Effective Wireless Scheduling via Hypergraph Sketches
- Cellular telephone networks and random maps in hypergraphs
- A recursive formula for the reliability of a r-uniform complete hypergraph and its applications
- Hypergraph theory. An introduction
- Zeon and idem-Clifford formulations of hypergraph problems
- Graph domination, coloring and cliques in telecommunications
- Theoretical Aspects of Graph Models for MANETs
- Power surplus solutions for weighted hypergraph communication situations
- Independent sets in semi-random hypergraphs
This page was built for publication: Hypergraph theory in wireless communication networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4600449)