Sciweavers

110 search results - page 17 / 22
» Greedy List Intersection
Sort
View
ENDM
2008
118views more  ENDM 2008»
13 years 10 months ago
Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H o...
Flavia Bonomo, Guillermo Durán, Francisco J...
STOC
2012
ACM
185views Algorithms» more  STOC 2012»
12 years 7 days ago
Subspace evasive sets
In this work we describe an explicit, simple, construction of large subsets of Fn , where F is a finite field, that have small intersection with every k-dimensional affine subsp...
Zeev Dvir, Shachar Lovett
BMCBI
2008
137views more  BMCBI 2008»
13 years 10 months ago
VennMaster: Area-proportional Euler diagrams for functional GO analysis of microarrays
Background: Microarray experiments generate vast amounts of data. The functional context of differentially expressed genes can be assessed by querying the Gene Ontology (GO) datab...
Hans A. Kestler, André Müller, Johann ...
EM
2010
155views Management» more  EM 2010»
13 years 10 months ago
Hyperbolic Graphs of Small Complexity
In this paper we enumerate and classify the "simplest" pairs (M, G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the p...
Damian Heard, Craig Hodgson, Bruno Martelli, Carlo...
DKE
2010
101views more  DKE 2010»
13 years 10 months ago
Effective pruning for XML structural match queries
Extensible Markup Language (XML) is becoming the de facto standard for exchanging information over the Internet, which results in the proliferation of XML documents. This has led ...
Yefei Xin, Zhen He, Jinli Cao