Titlebook: Experimental Algorithms; 13th International S Joachim Gudmundsson,Jyrki Katajainen Conference proceedings 2014 Springer International Publi

健忘症

0302-9743 submissions. The papers are organized in topical sections on combinatorial optimization, data structures, graph drawing, shortest path, strings, graph algorithms and suffix structures..978-3-319-07958-5978-3-319-07959-2Series ISSN 0302-9743 Series E-ISSN 1611-3349

CRATE

minimal

诱拐

https://doi.org/10.1007/978-3-030-44630-7 instances from various graph classes, random and from the literature, with up to several hundred vertices. In particular we investigate how complexity results match computational experience and how combinatorial properties help improving the algorithm’s performance.

Focus-Words

liposuction

Gendering Theories of European Integrationwork, we study implementations of connected components and minimum spanning forest on PSW and show that they have a competitive I/O bound of .(sort(.)log(./.)) and also work well in practice. We also show that our MSF implementation is competitive with a specialized algorithm proposed by Dementiev et al. [10] while being much simpler.

Phagocytes

corn732

Gendermedizin in der klinischen Praxisn finding edge-disjoint paths in a graph constructed from the input trajectories. The underlying optimization problem is a new and interesting network flow variant. Even though the problem is NP-complete, two heuristics work well in practice, outperforming all other approaches, including the best automated system.

HAWK

CLOUT

DenseZDD: A Compact and Fast Index for Families of Setsor static ZDDs. Our technique not only indexes set families compactly but also executes fast member membership operations. We also propose a hybrid method of DenseZDD and ordinary ZDDs to allow for dynamic indices.