540 search results - page 79 / 108 » New bounds on the edge number of a k-map graph |
WEA
2007
Springer
14 years 3 months ago
2007
Springer
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
IH
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. One way to protect a digital product is to embed an author's signature into the object in the form of minute errors. However, this technique cannot be directly appli...
CCR
2004
13 years 8 months ago
2004
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...
PODC
2003
ACM
14 years 2 months ago
2003
ACM
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...
AAAI
1996
13 years 10 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...