4171 search results - page 612 / 835 » Choice numbers of graphs |
165
click to vote
CICLING
2003
Springer
15 years 11 months ago
2003
Springer
Finite-state processing is typically based on structures that allow for efficient indexing and sequential search. However, this “rigid” framework has several disadvantages when...
161
click to vote
ESA
2003
Springer
15 years 11 months ago
2003
Springer
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
176
click to vote
GBRPR
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...
168
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
156
click to vote
ICSM
2002
IEEE
15 years 11 months ago
2002
IEEE
Class cohesion could be used to evaluate the design quality of classes, to develop test measures for objectoriented software and to restructure poorly designed classes. Among a nu...