117 search results - page 19 / 24 » Graphs with Chromatic Roots in the Interval (1, 2) |
80
Voted
TCS
2008
15 years 9 days ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
108
click to vote
SAC
2006
ACM
15 years 6 months ago
2006
ACM
This paper introduces the MTree index algorithm, a special purpose XML XPath index designed to meet the needs of the hierarchical XPath query language. With the increasing importa...
COCOON
2009
Springer
15 years 7 months ago
2009
Springer
In [3], the authors introduced the Generalised Character Compatibility Problem as a generalisation of the Perfect Phylogeny Problem for a set of species. This generalised problem t...
88
Voted
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
110
Voted
ECML
2004
Springer
15 years 5 months ago
2004
Springer
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...