1538 search results - page 134 / 308 » Spectral Techniques in Graph Algorithms |
123
click to vote
ASPDAC
2011
ACM
14 years 5 months ago
2011
ACM
– This paper concerns throughput-constrained parallel execution of synchronous data flow graphs. This paper assumes static mapping and dynamic scheduling of nodes, which has seve...
95
Voted
WABI
2007
Springer
15 years 7 months ago
2007
Springer
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
129
Voted
SIGSOFT
1994
ACM
15 years 5 months ago
1994
ACM
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
107
Voted
APVIS
2004
15 years 3 months ago
2004
The visualisation pipeline approach is a flexible and extensible technique for generating visualisations. The basic pipeline functions involve the capture and representation of da...
FSTTCS
2006
Springer
15 years 5 months ago
2006
Springer
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...