31 search results - page 5 / 7 » Degree-constrained orientations of embedded graphs |
173
click to vote
CCCG
2008
15 years 7 months ago
2008
Let G be a graph embedded in the L1-plane. The stretch factor of G is the maximum over all pairs of distinct vertices p and q of G of the ratio LG 1 (p, q)/L1(p, q), where LG 1 (p...
154
click to vote
COMBINATORICS
1999
15 years 6 months ago
1999
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
150
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We observe a certain random process on a graph ”locally”, i.e., in the neighborhood of a node, and would like to derive information about ”global” properties of the graph....
165
click to vote
SIES
2007
IEEE
16 years 19 days ago
2007
IEEE
— The research field of partitioning for electronic systems started to attract significant attention of scientists about fifteen years ago. Gaining ever more importance due to...
175
click to vote
FEDCSIS
2011
14 years 6 months ago
2011
—Collaborative mechanisms between services are a crucial aspect in the recent development of pervasive computing systems based on the paradigm of service-oriented architecture. C...