540 search results - page 99 / 108 » New bounds on the edge number of a k-map graph |
PODC
2004
ACM
14 years 1 months ago
2004
ACM
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— The need to monitor real time network services has prompted service providers to use new measurement technologies, such as service-specific probes. Service-specific probes ar...
SDM
2008
SIAM
13 years 9 months ago
2008
SIAM
The rigid all-versus-all adjacency required by a maximal biclique for its two vertex sets is extremely vulnerable to missing data. In the past, several types of quasi-bicliques ha...
CCCG
2006
13 years 9 months ago
2006
The problem of representing triangulations has been widely studied to obtain convenient encodings and space efficient data structures. In this paper we propose a new practical app...
OL
2008
13 years 7 months ago
2008
By introducing redundant Klee-Minty examples, we have previously shown that the central path can be bent along the edges of the Klee-Minty cubes, thus having 2n - 2 sharp turns in...