1162 search results - page 56 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
ALGORITHMICA
2010
13 years 8 months ago
2010
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
DAC
2005
ACM
14 years 9 months ago
2005
ACM
Signal processing and multimedia applications are often implemented on resource constrained embedded systems. It is therefore important to find implementations that use as little ...
PKDD
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we introduce graph-evolution rules, a novel type of frequency-based pattern that describe the evolution of large networks over time, at a local level. Given a sequenc...
IEEESCC
2009
IEEE
13 years 6 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...