Sciweavers

2503 search results - page 139 / 501
» A study of 3-arc graphs
Sort
View
GD
2006
Springer
15 years 10 months ago
Choosing Colors for Geometric Graphs Via Color Space Embeddings
Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. However additional work must still be done to dra...
Michael B. Dillencourt, David Eppstein, Michael T....
DAM
2010
92views more  DAM 2010»
15 years 6 months ago
Enumeration of matchings in families of self-similar graphs
The number of matchings of a graph G is an important graph parameter in various contexts, notably in statistical physics (dimer-monomer model). Following recent research on graph p...
Elmar Teufl, Stephan Wagner
DM
2006
78views more  DM 2006»
15 years 6 months ago
On polynomial digraphs
Let (x, y) be a bivariate polynomial with complex coefficients. The zeroes of (x, y) are given a combinatorial structure by considering them as arcs of a directed graph G(). This p...
Josep M. Brunat, Antonio Montes
PODC
2011
ACM
14 years 9 months ago
Coordinated consensus in dynamic networks
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
Fabian Kuhn, Rotem Oshman, Yoram Moses
WWW
2008
ACM
16 years 7 months ago
Substructure similarity measurement in chinese recipes
Improving the precision of information retrieval has been a challenging issue on Chinese Web. As exemplified by Chinese recipes on the Web, it is not easy/natural for people to us...
Liping Wang, Qing Li, Na Li, Guozhu Dong, Yu Yang