1162 search results - page 39 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
115
click to vote
CASES
2009
ACM
15 years 10 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...
351
click to vote
IWOCA
2010
Springer
14 years 10 months ago
2010
Springer
A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-complete to compute a path-ba...
130
click to vote
STACS
2009
Springer
15 years 10 months ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...
125
Voted
WCRE
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—Object-oriented (OO) software is usually organized into subsystems using the concepts of package or module. Such modular structure helps applications to evolve when faci...
172
click to vote
SODA
2012
ACM
13 years 6 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...