Sciweavers

310 search results - page 50 / 62
» dam 2008
Sort
View
DAM
2008
88views more  DAM 2008»
13 years 10 months ago
On the asymmetric representatives formulation for the vertex coloring problem
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
Manoel B. Campêlo, Victor A. Campos, Ricardo...
DAM
2008
109views more  DAM 2008»
13 years 10 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...
DAM
2008
108views more  DAM 2008»
13 years 10 months ago
On the complexity of the multicut problem in bounded tree-width graphs and digraphs
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
Cédric Bentz
DAM
2008
145views more  DAM 2008»
13 years 10 months ago
Graph coloring in the estimation of sparse derivative matrices: Instances and applications
We describe a graph coloring problem associated with the determination of mathematical derivatives. The coloring instances are obtained as intersection graphs of row partitioned s...
Shahadat Hossain, Trond Steihaug
DAM
2008
83views more  DAM 2008»
13 years 10 months ago
Multi-group support vector machines with measurement costs: A biobjective approach
Support Vector Machine has shown to have good performance in many practical classification settings. In this paper we propose, for multi-group classification, a biobjective optimi...
Emilio Carrizosa, Belen Martin-Barragan, Dolores R...