Sciweavers

1477 search results - page 5 / 296
» On Graph Problems in a Semi-streaming Model
Sort
View
STACS
2010
Springer
15 years 4 months ago
The Recognition of Tolerance and Bounded Tolerance Graphs
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This subclass of perfect graphs has bee...
George B. Mertzios, Ignasi Sau, Shmuel Zaks
57
Voted
NIPS
2003
14 years 11 months ago
Denoising and Untangling Graphs Using Degree Priors
This paper addresses the problem of untangling hidden graphs from a set of noisy detections of undirected edges. We present a model of the generation of the observed graph that in...
Quaid Morris, Brendan J. Frey
ICSM
2003
IEEE
15 years 2 months ago
On Modeling Software Architecture Recovery as Graph Matching
This paper presents a graph matching model for the software architecture recovery problem. Because of their expressiveness, the graphs have been widely used for representing both ...
Kamran Sartipi, Kostas Kontogiannis
NETWORKS
2010
14 years 8 months ago
Probabilistic models for the Steiner Tree problem
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...
98
Voted
DM
2007
125views more  DM 2007»
14 years 9 months ago
Generalized switch-setting problems
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...
Torsten Muetze