356 search results - page 7 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
CHI
2005
ACM
15 years 10 months ago
2005
ACM
We study a collaborative location-based game in which groups of `lions' hunt together on a virtual savannah that is overlaid on an open playing field. The game implements a s...
WG
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We generalize the notions of flippable and simultaneously-flippable edges in a triangulation of a set S of points in the plane, into so called pseudo simultaneously-flippable edge...
ANCS
2005
ACM
15 years 3 months ago
2005
ACM
Network edge packet-processing systems, as are commonly implemented on network processor platforms, are increasingly required to support a rich set of services. These multi-servic...
SODA
1998
ACM
14 years 11 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...