1952 search results - page 124 / 391 » Complete partitions of graphs |
153
click to vote
DMTCS
2010
15 years 1 months ago
2010
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulation...
203
click to vote
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
Current application development tools provide completely different programming models for the application server (e.g., Java and J2EE) and the client web browser (e.g., JavaScript...
165
click to vote
EMSOFT
2004
Springer
15 years 9 months ago
2004
Springer
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
146
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
Abstract. We implement Groenendijk and Stokhof's partition semantics of questions in a simple question answering algorithm. The algorithm is sound, complete, and based on tabl...
114
click to vote
STOC
1993
ACM
15 years 8 months ago
1993
ACM
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...