388 search results - page 62 / 78 » On the Number of Cycles in Planar Graphs |
IWDC
2005
Springer
14 years 1 months ago
2005
Springer
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
DM
2008
13 years 8 months ago
2008
The chromatic capacity cap(G) of a graph G is the largest k for which there exists a k-coloring of the edges of G such that, for every coloring of the vertices of G with the same ...
CRITIS
2007
13 years 9 months ago
2007
Abstract In this paper we discuss the properties and algorithmic methods for the identification and classification of cyclical interdependencies in critical infrastructures based...
AAAI
2012
11 years 10 months ago
2012
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
CASES
2009
ACM
14 years 2 months ago
2009
ACM
This paper solves the open problem of extracting the maximal number of iterations from a loop that can be executed in parallel on chip multiprocessors. Our algorithm solves it opt...