Sciweavers

20 search results - page 2 / 4
» Galaxy cutsets in graphs
Sort
View
COMBINATORICA
2002
58views more  COMBINATORICA 2002»
14 years 11 months ago
Perfect Graphs, Partitionable Graphs and Cutsets
Michele Conforti, Gérard Cornuéjols,...
INFOCOM
2009
IEEE
15 years 5 months ago
Circuits/Cutsets Duality and a Unified Algorithmic Framework for Survivable Logical Topology Design in IP-over-WDM Optical Netwo
: Given a logical topology and a physical topology , the survivable logical topology design problem in an IP-overWDM optical network is to map the logical links into lightpaths in ...
Krishnaiyan Thulasiraman, Muhammad S. Javed, Guoli...
JAIR
2007
112views more  JAIR 2007»
14 years 11 months ago
Cutset Sampling for Bayesian Networks
The paper presents a new sampling methodology for Bayesian networks that samples only a subset of variables and applies exact inference to the rest. Cutset sampling is a network s...
Bozhena Bidyuk, Rina Dechter
ICCAD
2007
IEEE
161views Hardware» more  ICCAD 2007»
15 years 8 months ago
Clustering based pruning for statistical criticality computation under process variations
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...
Hushrav Mogal, Haifeng Qian, Sachin S. Sapatnekar,...
DM
1998
95views more  DM 1998»
14 years 11 months ago
An Euler-type formula for median graphs
Let G be a median graph on n vertices and m edges and let k be the number of equivalence classes of the Djokovi´c’s relation Θ defined on the edge-set of G. Then 2n − m −...
Sandi Klavzar, Henry Martyn Mulder, Riste Skrekovs...