1749 search results - page 83 / 350 » Conditional colorings of graphs |
175
click to vote
TCOM
2011
15 years 1 months ago
2011
—Low-density parity-check (LDPC) codes are gaining interest for high data rate applications in both terrestrial and spatial communications. They can be designed and studied throu...
158
click to vote
WAOA
2005
Springer
15 years 12 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...
160
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
State-of-the-art stereo vision algorithms utilize color changes as important cues for object boundaries. Most methods impose heuristic restrictions or priors on disparities, for e...
146
click to vote
GG
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Hierarchical graph transformation as defined in [1, 2] extends double-pushout graph transformation in the spirit of term rewriting: Graphs are provided with hierarchical...