Sciweavers

4255 search results - page 8 / 851
» Cover
Sort
View
ESOP
2008
Springer
13 years 9 months ago
Cover Algorithms and Their Combination
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
Sumit Gulwani, Madan Musuvathi
DAM
1999
119views more  DAM 1999»
13 years 7 months ago
On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
David Manlove
CCCG
2010
13 years 9 months ago
On the perimeter of fat objects
We show that the size of the perimeter of (, )-covered objects is a linear function of the diameter. Specifically, for an (, )-covered object O, per(O) c diam(O) sin2 , for a pos...
Prosenjit Bose, Otfried Cheong, Vida Dujmovic
CSR
2008
Springer
13 years 9 months ago
Comparing Universal Covers in Polynomial Time
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
Jirí Fiala, Daniël Paulusma