Sciweavers

2503 search results - page 126 / 501
» A study of 3-arc graphs
Sort
View
STOC
2010
ACM
274views Algorithms» more  STOC 2010»
16 years 3 months ago
Odd Cycle Packing
We study the ratio between the minimum size of an odd cycle vertex transversal and the maximum size of a collection of vertex-disjoint odd cycles in a planar graph. We show that th...
Ken-ichi Kawarabayashi and Bruce Reed
ER
2009
Springer
92views Database» more  ER 2009»
16 years 24 days ago
On Matrix Representations of Participation Constraints
Abstract. We discuss the existence of matrix representations for generalised and minimum participation constraints which are frequently used in database design and conceptual model...
Sven Hartmann, Uwe Leck, Sebastian Link
IV
2007
IEEE
105views Visualization» more  IV 2007»
16 years 16 days ago
Mapping a Local Web Domain
In this study, we crawled a local Web domain, created its graph representation, and analyzed the network structure. The results of network analysis revealed local scalefree patter...
Weimao Ke, Tiago Simas
ICANN
2007
Springer
16 years 12 days ago
Theoretical Analysis of Accuracy of Gaussian Belief Propagation
Abstract. Belief propagation (BP) is the calculation method which enables us to obtain the marginal probabilities with a tractable computational cost. BP is known to provide true m...
Yu Nishiyama, Sumio Watanabe
COCOON
2005
Springer
15 years 11 months ago
A Tight Analysis of the Maximal Matching Heuristic
We study the worst-case performance of the maximal matching heuristic applied to the Minimum Vertex Cover and Minimum Maximal Matching problems, through a careful analysis of tigh...
Jean Cardinal, Martine Labbé, Stefan Langer...