Sciweavers

649 search results - page 80 / 130
» A Graph Pebbling Algorithm on Weighted Graphs
Sort
View
PEPM
2010
ACM
14 years 5 months ago
Conditional weighted pushdown systems and applications
Pushdown systems are well understood as abstract models of programs with (recursive) procedures. Reps et al. recently extended pushdown systems into weighted pushdown systems, whi...
Xin Li, Mizuhito Ogawa
EVOW
2008
Springer
13 years 10 months ago
Divide, Align and Full-Search for Discovering Conserved Protein Complexes
Advances in modern technologies for measuring protein-protein interaction (PPI) has boosted research in PPI networks analysis and comparison. One of the challenging problems in com...
Pavol Jancura, Jaap Heringa, Elena Marchiori
ISPD
2010
ACM
249views Hardware» more  ISPD 2010»
14 years 3 months ago
A matching based decomposer for double patterning lithography
Double Patterning Lithography (DPL) is one of the few hopeful candidate solutions for the lithography for CMOS process beyond 45nm. DPL assigns the patterns less than a certain di...
Yue Xu, Chris Chu
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 9 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
APPROX
2010
Springer
138views Algorithms» more  APPROX 2010»
13 years 10 months ago
Maximum Flows on Disjoint Paths
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
Guyslain Naves, Nicolas Sonnerat, Adrian Vetta