Sciweavers

779 search results - page 37 / 156
» A graph polynomial for independent sets of bipartite graphs
Sort
View
JAL
2000
119views more  JAL 2000»
14 years 9 months ago
On Markov Chains for Independent Sets
Random independent sets in graphs arise, for example, in statistical physics, in the hard-core model of a gas. In 1997, Luby and Vigoda described a rapidly mixing Markov chain for...
Martin E. Dyer, Catherine S. Greenhill
CANDC
2005
ACM
14 years 9 months ago
A family of metrics for biopolymers based on counting independent sets
We introduce a new family of metrics for graphs of fixed size, based on counting-independent sets. Our definition is simpler and easier to e than the edge ideal metric family defi...
Jairo Rocha, Mercè Llabrés, Ricardo ...
DAM
2008
109views more  DAM 2008»
14 years 9 months ago
Minimal comparability completions of arbitrary graphs
A transitive orientation of an undirected graph is an assignment of directions to its edges so that these directed edges represent a transitive relation between the vertices of th...
Pinar Heggernes, Federico Mancini, Charis Papadopo...
FSTTCS
2010
Springer
14 years 7 months ago
Satisfiability of Acyclic and Almost Acyclic CNF Formulas
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...
Sebastian Ordyniak, Daniël Paulusma, Stefan S...
CORR
2010
Springer
66views Education» more  CORR 2010»
14 years 9 months ago
The overlap number of a graph
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The ov...
Bill Rosgen, Lorna Stewart