Sciweavers

131 search results - page 2 / 27
» Hypergraphs with independent neighborhoods
Sort
View
WG
1993
Springer
13 years 9 months ago
Dually Chordal Graphs
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for cha...
Andreas Brandstädt, Feodor F. Dragan, Victor ...
CAIP
2001
Springer
166views Image Analysis» more  CAIP 2001»
13 years 9 months ago
Application of Adaptive Hypergraph Model to Impulsive Noise Detection
In this paper, using hypergraph theory, we introduce an image model called Adaptive Image Neighborhood Hypergraph (AINH). From this model we propose a combinatorial definition of ...
Soufiane Rital, Alain Bretto, Driss Aboutajdine, H...
FCT
2005
Springer
13 years 11 months ago
Path Coupling Using Stopping Times
Abstract. We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Glauber dynamics ...
Magnus Bordewich, Martin E. Dyer, Marek Karpinski
ICALP
2009
Springer
14 years 5 months ago
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
Elena Losievskaja, Geir Agnarsson, Magnús M...
CORR
2010
Springer
175views Education» more  CORR 2010»
13 years 5 months ago
On affine rigidity
We study the properties of affine rigidity of a (hyper)graph and prove a variety of fundamental results. First, we show that affine rigidity is a generic property (i.e., only depen...
Steven J. Gortler, Craig Gotsman, Ligang Liu, Dyla...