An optimal algorithm for stopping on the element closest to the center of an interval | 0 | 0.34 | 2022 |
Total Colorings of Graphs with Minimum Sum of Colors. | 0 | 0.34 | 2016 |
An efficient algorithm for stopping on a sink in a directed graph. | 1 | 0.36 | 2013 |
Chromatic Sums for Colorings Avoiding Monochromatic Subgraphs. | 1 | 0.45 | 2013 |
Polynomial Algorithm for Finding Chromatic Sum for Unicyclic and Outerplanar Graphs | 3 | 0.43 | 2005 |
Sphere-Of-Influence Graphs On A Sphere | 0 | 0.34 | 2004 |
The chromatic sum of a graph: history and recent developments | 10 | 1.11 | 2004 |
Steiner intervals in graphs | 12 | 0.97 | 1998 |
Agreement metrics for trees revisited. | 0 | 0.34 | 1996 |
An Efficient Method of Examining all Trees | 2 | 0.99 | 1996 |
Agreement Subtrees, Metric and Consensus for Labeled Binary Trees. | 1 | 1.02 | 1993 |
Using graph distance in object recognition | 16 | 0.88 | 1990 |
Approximation Algorithms for the Chromatic Sum | 20 | 2.05 | 1989 |