Sciweavers

279 search results - page 55 / 56
» Matching Polynomials And Duality
Sort
View
FSTTCS
2006
Springer
13 years 11 months ago
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
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,...
Sushmita Gupta, Venkatesh Raman, Saket Saurabh
IPCO
2010
125views Optimization» more  IPCO 2010»
13 years 9 months ago
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
ALMOB
2006
102views more  ALMOB 2006»
13 years 7 months ago
Mining, compressing and classifying with extensible motifs
Background: Motif patterns of maximal saturation emerged originally in contexts of pattern discovery in biomolecular sequences and have recently proven a valuable notion also in t...
Alberto Apostolico, Matteo Comin, Laxmi Parida
INFOCOM
2010
IEEE
13 years 6 months ago
Routing for Energy Minimization in the Speed Scaling Model
Abstract—We study network optimization that considers energy minimization as an objective. Studies have shown that mechanisms such as speed scaling can significantly reduce the ...
Matthew Andrews, Antonio Fernández, Lisa Zh...
ALGOSENSORS
2009
Springer
13 years 5 months ago
Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...