1951 search results - page 147 / 391 » An algorithm for improving graph partitions |
133
click to vote
SODA
2003
ACM
15 years 6 months ago
2003
ACM
We prove a lower bound of 0.3288 n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...
126
click to vote
STACS
2010
Springer
15 years 12 months ago
2010
Springer
We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r + ...
160
click to vote
CEC
2009
IEEE
15 years 9 months ago
2009
IEEE
VANETs are ad hoc networks in which devices are vehicles moving at high speeds. This kind of network is getting more and more importance since it has many practical and important a...
133
Voted
SAMOS
2004
Springer
15 years 10 months ago
2004
Springer
In this paper we present a new approach for generating high-speed optimized event-driven register transfer level (RTL) compiled simulators. The generation of the simulators is part...
117
click to vote
ICDM
2006
IEEE
15 years 11 months ago
2006
IEEE
Mining graph databases for frequent subgraphs has recently developed into an area of intensive research. Its main goals are to reduce the execution time of the existing basic algo...