32 search results - page 1 / 7 » Extended core and choosability of a graph |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
A graph G is (a, b)-choosable if for any color list of size a associated with each vertices, one can choose a subset of b colors such that adjacent vertices are colored with disjoi...
COCOON
2007
Springer
13 years 11 months ago
2007
Springer
In this paper, we give linear time algorithms to decide core stability, core largeness, exactness, and extendability of flow games on uniform networks (all edge capacities are 1)....
BMCBI
2010
13 years 4 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
LREC
2008
13 years 6 months ago
2008
A core ontology is a mid-level ontology which bridges the gap between an upper ontology and a domain ontology. Automatic Chinese core ontology construction can help quickly model ...
COCOA
2008
Springer
13 years 6 months ago
2008
Springer
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...