2255 search results - page 79 / 451 » Computing a Center-Transversal Line |
WG
2010
Springer
13 years 6 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
ICPR
2002
IEEE
14 years 8 months ago
2002
IEEE
A boundary sequence is a good representation of arbitrary shaped regions, but not directly used in computing shape features such as area, centroid, orientation, and so forth. In t...
SIGECOM
2010
ACM
14 years 15 days ago
2010
ACM
Computing optimal strategies to commit to in general normal-form or Bayesian games is a topic that has recently been gaining attention, in part due to the application of such algo...
TCS
2011
13 years 2 months ago
2011
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of computing the centroid of all the vertices in a non-degenerate arrangement of n lines. The trivial approach requires the enumeration of all `n 2 ´ verti...