Sciweavers

3204 search results - page 224 / 641
» The b-chromatic Number of a Graph
Sort
View
ICCV
2005
IEEE
15 years 21 days ago
Bottom-up/Top-Down Image Parsing by Attribute Graph Grammar
In this paper, we present an attribute graph grammar for image parsing on scenes with man-made objects, such as buildings, hallways, kitchens, and living rooms. We choose one clas...
Feng Han, Song Chun Zhu
GD
1998
Springer
14 years 3 months ago
Drawing Large Graphs with H3Viewer and Site Manager
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI's Site Manager application. Our...
Tamara Munzner
ARSCOM
2005
64views more  ARSCOM 2005»
13 years 10 months ago
Hamilton Paths in Certain Arithmetic Graphs
For each integer m 1, consider the graph Gm whose vertex set is the set N = {0, 1, 2, . . . } of natural numbers and whose edges are the pairs xy with y = x + m or y = x - m or y...
Paul A. Russell
FOCS
2008
IEEE
14 years 5 months ago
Mixing Time of Exponential Random Graphs
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
Shankar Bhamidi, Guy Bresler, Allan Sly
ISAAC
2004
Springer
102views Algorithms» more  ISAAC 2004»
14 years 4 months ago
Polynomial Deterministic Rendezvous in Arbitrary Graphs
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
Dariusz R. Kowalski, Andrzej Pelc