Sciweavers

779 search results - page 82 / 156
» A graph polynomial for independent sets of bipartite graphs
Sort
View
DAC
1998
ACM
15 years 10 months ago
Efficient Coloring of a Large Spectrum of Graphs
We have developed a new algorithm and software for graph coloring by systematically combining several algorithm and software development ideas that had crucial impact on the algor...
Darko Kirovski, Miodrag Potkonjak
ICDM
2008
IEEE
120views Data Mining» more  ICDM 2008»
15 years 4 months ago
Anti-monotonic Overlap-Graph Support Measures
In graph mining, a frequency measure is anti-monotonic if the frequency of a pattern never exceeds the frequency of a subpattern. The efficiency and correctness of most graph pat...
Toon Calders, Jan Ramon, Dries Van Dyck
ICQNM
2007
IEEE
131views Chemistry» more  ICQNM 2007»
15 years 4 months ago
Comparison of two bounds of the quantum correlation set
— From a geometric viewpoint, quantum nonlocality between two parties is represented as the difference of two convex bodies, namely the sets of possible results of classical and ...
David Avis, Tsuyoshi Ito
ACTA
2007
92views more  ACTA 2007»
14 years 10 months ago
Solving #SAT using vertex covers
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
CORR
2010
Springer
143views Education» more  CORR 2010»
14 years 10 months ago
Efficient and exact sampling of simple graphs with given arbitrary degree sequence
Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications rangi...
Charo I. Del Genio, Hyunju Kim, Zoltán Toro...