253 search results - page 49 / 51 » Perfection thickness of graphs |
74
Voted
COMPGEOM
2004
ACM
15 years 2 months ago
2004
ACM
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many...
103
click to vote
SWAT
2010
Springer
15 years 2 months ago
2010
Springer
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
101
Voted
KDD
2012
ACM
12 years 12 months ago
2012
ACM
Trust networks, where people leave trust and distrust feedback, are becoming increasingly common. These networks may be regarded as signed graphs, where a positive edge weight cap...
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
82
Voted
OSDI
2006
ACM
15 years 9 months ago
2006
ACM
Automatic tools for finding software errors require a set of specifications before they can check code: if they do not know what to check, they cannot find bugs. This paper presen...