3268 search results - page 103 / 654 » The hub number of a graph |
168
click to vote
ICCS
2007
Springer
15 years 10 months ago
2007
Springer
We propose in this paper an extension of Conceptual Graphs that allows to use datatypes (strings, numbers, ...) for typing concept nodes. Though the model-theoretic semantics of th...
145
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
By using recent results from graph theory, including the Strong Perfect Graph Theorem, we obtain a unifying framework for a number of tractable classes of constraint problems. Thes...
141
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
Abstract. This paper presents algorithms whose input is an undirected graph, and whose output is a tree decomposition of width that approximates the optimal, the treewidth of that ...
122
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
A solution to a problem of Erdos, Rubin and Taylor is obtained by showing that if a graph G is (a : b)-choosable, and c/d > a/b, then G is not necessarily (c : d)-choosable. Th...
169
click to vote
CGF
2004
15 years 6 months ago
2004
This paper describes a novel approach to the parameterization of triangle meshes representing 2-manifolds with an arbitrary genus. A topology-based decomposition of the shape is c...