4378 search results - page 202 / 876 » On the Complexity of Ordered Colourings |
172
click to vote
IPL
2010
15 years 5 months ago
2010
We present an O(n) Breadth-First Search algorithm for trapezoid graphs, which takes as input a trapezoid model and any priority order on the vertices. Our algorithm is the first ...
127
click to vote
JCT
2010
15 years 1 months ago
2010
We determine the nature of the fixed point sets of groups of order p, acting on complexes of distinguished p-subgroups (those p-subgroups containing pcentral elements in their cent...
187
click to vote
JACM
2007
15 years 6 months ago
2007
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
185
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
Motion layer estimation has recently emerged as a promising object tracking method. In this paper, we extend previous research on layer-based tracker by introducing the concept of...
168
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...