Live briefing
Everything about Graph bandwidth
Node labeling problem in graph theory
In graph theory, the graph bandwidth problem may be visualized as placing the vertices of a given graph at distinct integer positions along the number line so that the length of the longest edge is minimized. Such placement is called linear graph arrangement, linear graph layout or linear graph placement. It may be formalized as labeling the vertices of a graph with distinct integers so that the quantity is minimized, where is the edge set of. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Graph bandwidthA 5-minute orientation
- Skim a recent paper: Active tunable terahertz bandwidth absorber based on single layer grapheneInfluential work since 2022
- Pick up a classic book: Network and Parallel ComputingThe most-reprinted book on the subject
- Read the landmark paper: Using High-Bandwidth Networks Efficiently for Fast Graph ComputationCited 57 times
- Go sideways: CutwidthA closely related topic
- Go sideways: PathwidthA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Using High-Bandwidth Networks Efficiently for Fast Graph Computation
Finding the minimum bandwidth of an interval graph
Generalized Gene Adjacencies, Graph Bandwidth, and Clusters in Yeast Evolution
Impact of Signal-to-Noise Ratio and Bandwidth on Graph Laplacian Spectrum From High-Dimensional Noisy Point Cloud
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
Characterization of graphs with equal bandwidth and cyclic bandwidth
On the bandwidth of a Hamming graph
On semidefinite programming bounds for graph bandwidth
🆕 Influential since 2022
Active tunable terahertz bandwidth absorber based on single layer graphene
Joint Bandwidth and Spectrum Usage Zones Flexible Allocation for Coexisting Multiple UAV Networks: An Interference Graph Approach
On the solution of the graph bandwidth problem by means of search methods
Proactive Bandwidth Allocation for V2X Networks With Multi-Attentional Deep Graph Learning
Graph-based Tool for Bandwidth Estimation, Health Monitoring and Update Planning in Broadband Networks
đź“š Books worth reading
Network and Parallel ComputingJames J. Park · 2012- 📕The bandwidth of graphsNorman Edgar Gibbs · 1969
- 📕NP-Completeness for Mathematical Programming, Program Optimization, Graph Theory and SetsDaljit S. Jandu · 2006
Selected papers on analysis of algorithmsDonald Knuth · 2000
High-Performance ComputingJesus Labarta · 2008
IBM PC and PS/2 graphics handbookEdward R. Teja · 1990
ICICS 2017 · 2017
Digital Signal Processing · 2006
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Cutwidth In graph theory, the cutwidth of an undirected graph is the smallest integer k {\displaystyle k} with the following property: there is an ordering of the…
- Pathwidth In graph theory, a path decomposition of a graph G is, informally, a representation of G as a "thickened" path graph, and the pathwidth of G is a number…
- Chordal completion In graph theory, a branch of mathematics, a chordal completion of a given undirected graph G is a chordal graph, on the same vertex set, that has G as…
- Tree-depth In graph theory, the tree-depth of a connected undirected graph G {\displaystyle G} is a numerical invariant of G {\displaystyle G} , the minimum height…
- David Shmoys David Bernard Shmoys (born 1959) is a Professor in the School of Operations Research and Information Engineering and the Department of Computer Science…
- Graph partition In mathematics, a graph partition is the reduction of a graph to a smaller graph by partitioning its set of nodes into mutually exclusive groups. Edges…
- Lovász number In graph theory, the Lovász number of a graph is a real number that is an upper bound on the Shannon capacity of the graph. It is also known as Lovász…
- Kernelization In computer science, a kernelization is a technique for designing efficient algorithms that achieve their efficiency by a preprocessing stage in which…