Sciweavers

765 search results - page 97 / 153
» Graph Coloring with Rejection
Sort
View
CVPR
2007
IEEE
14 years 10 months ago
Layered Graph Match with Graph Editing
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...
Liang Lin, Song Chun Zhu, Yongtian Wang
AVI
2006
13 years 10 months ago
Line graph explorer: scalable display of line graphs using Focus+Context
Scientific measurements are often depicted as line graphs. Stateof-the-art high throughput systems in life sciences, telemetry and electronics measurement rapidly generate hundred...
Robert Kincaid, Heidi Lam
SPAA
2003
ACM
14 years 2 months ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
WG
2010
Springer
13 years 7 months ago
max-cut and Containment Relations in Graphs
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
Marcin Kaminski
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 8 months ago
Deploying Wireless Networks with Beeps
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
Alejandro Cornejo, Fabian Kuhn