139 search results - page 13 / 28 » Computing crossing numbers in quadratic time |
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
CLUSTER
2004
IEEE
13 years 8 months ago
2004
IEEE
An increasing number of applications are being developed using distributed object computing (DOC) middleware, such as CORBA. Many of these applications require the underlying midd...
PRL
2010
13 years 3 months ago
2010
For fast classification under real-time constraints, as required in many imagebased pattern recognition applications, linear discriminant functions are a good choice. Linear discr...
GD
1998
Springer
14 years 25 days ago
1998
Springer
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
TCS
2008
13 years 8 months ago
2008
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...