COMBINATORICS
2007
14 years 2 months ago
2007
In this paper, we prove that in a multigraph whose density Γ exceeds the maximum vertex degree ∆, the collection of minimal clusters (maximally dense sets of vertices) is cycle...
CCCG
2001
14 years 4 months ago
2001
We show that every set of n points in general position has a minimum pseudo-triangulation whose maximum vertex degree is five. In addition, we demonstrate that every point set in ...
PATMOS
2004
Springer
14 years 8 months ago
2004
Springer
Motivated by very/ultra large scale integrated circuit (VLSI/ULSI) physical design applications, we study the construction of rectilinear minimum spanning tree (RMST) with its maxi...
WAOA
2005
Springer
14 years 8 months ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...