↓ Skip to main content
What is this page? Embed badge

Algorithm Theory — SWAT 2002

Overview of attention for book
Cover of 'Algorithm Theory — SWAT 2002'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 An Efficient Quasidictionary
  3. Altmetric Badge
    Chapter 2 Combining Pattern Discovery and Probabilistic Modeling in Data Mining
  4. Altmetric Badge
    Chapter 3 Time and Space Efficient Multi-method Dispatching
  5. Altmetric Badge
    Chapter 4 Linear Time Approximation Schemes for Vehicle Scheduling
  6. Altmetric Badge
    Chapter 5 Minimizing Makespan for the Lazy Bureaucrat Problem
  7. Altmetric Badge
    Chapter 6 A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times
  8. Altmetric Badge
    Chapter 7 Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains
  9. Altmetric Badge
    Chapter 8 Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D
  10. Altmetric Badge
    Chapter 9 Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains
  11. Altmetric Badge
    Chapter 10 Exact Algorithms and Approximation Schemes for Base Station Placement Problems
  12. Altmetric Badge
    Chapter 11 A Factor-2 Approximation for Labeling Points with Maximum Sliding Labels
  13. Altmetric Badge
    Chapter 12 Optimal Algorithm for a Special Point-Labeling Problem
  14. Altmetric Badge
    Chapter 13 Random Arc Allocation and Applications
  15. Altmetric Badge
    Chapter 14 On Neighbors in Geometric Permutations
  16. Altmetric Badge
    Chapter 15 Powers of Geometric Intersection Graphs and Dispersion Algorithms
  17. Altmetric Badge
    Chapter 16 Efficient Data Reduction for Dominating Set: A Linear Problem Kernel for the Planar Case
  18. Altmetric Badge
    Chapter 17 Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous
  19. Altmetric Badge
    Chapter 18 Approximation hardness of the Steiner Tree Problem on graphs
  20. Altmetric Badge
    Chapter 19 The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus
  21. Altmetric Badge
    Chapter 20 The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms
  22. Altmetric Badge
    Chapter 21 A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid
  23. Altmetric Badge
    Chapter 22 Approximation Algorithms for Edge-Dilation k -Center Problems
  24. Altmetric Badge
    Chapter 23 Forewarned Is Fore-Armed: Dynamic Digraph Connectivity with Lookahead Speeds Up a Static Clustering Algorithm
  25. Altmetric Badge
    Chapter 24 Improved Algorithms for the Random Cluster Graph Model
  26. Altmetric Badge
    Chapter 25 Δ-List Vertex Coloring in Linear Time
  27. Altmetric Badge
    Chapter 26 Robot Localization without Depth Perception
  28. Altmetric Badge
    Chapter 27 Online Parallel Heuristics and Robot Searching under the Competitive Framework
  29. Altmetric Badge
    Chapter 28 Analysis of Heuristics for the Freeze-Tag Problem
  30. Altmetric Badge
    Chapter 29 Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems
  31. Altmetric Badge
    Chapter 30 All-Norm Approximation Algorithms
  32. Altmetric Badge
    Chapter 31 Approximability of Dense Instances of Nearest Codeword Problem
  33. Altmetric Badge
    Chapter 32 Call Control with k Rejections
  34. Altmetric Badge
    Chapter 33 On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem
  35. Altmetric Badge
    Chapter 34 Packet Bundling
  36. Altmetric Badge
    Chapter 35 Algorithms for the Multi-constrained Routing Problem
  37. Altmetric Badge
    Chapter 36 Computing the Threshold for q -Gram Filters
  38. Altmetric Badge
    Chapter 37 On the Generality of Phylogenies from Incomplete Directed Characters
  39. Altmetric Badge
    Chapter 38 Sorting with a Forklift
  40. Altmetric Badge
    Chapter 39 Tree Decompositions with Small Cost
  41. Altmetric Badge
    Chapter 40 Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition
  42. Altmetric Badge
    Chapter 41 Performance Tuning an Algorithm for Compressing Relational Tables
  43. Altmetric Badge
    Chapter 42 A Randomized In-Place Algorithm for Positioning the k th Element in a Multiset
  44. Altmetric Badge
    Chapter 43 Paging on a RAM with Limited Resources
  45. Altmetric Badge
    Chapter 44 An Optimal Algorithm for Finding NCA on Pure Pointer Machines
  46. Altmetric Badge
    Chapter 45 Amortized Complexity of Bulk Updates in AVL-Trees
Attention for Chapter 25: Δ-List Vertex Coloring in Linear Time
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
2 Mendeley
Summary Dimensions citations
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Δ-List Vertex Coloring in Linear Time
Chapter number 25
Book title
Algorithm Theory — SWAT 2002
Published by
Springer, Berlin, Heidelberg, July 2002
DOI 10.1007/3-540-45471-3_25
Book ISBNs
978-3-54-043866-3, 978-3-54-045471-7
Authors

San Skulrattanakulchai, Skulrattanakulchai, San

View on publisher site
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Professor > Associate Professor 1 50%
Lecturer 1 50%
Readers by discipline Count As %
Mathematics 1 50%
Agricultural and Biological Sciences 1 50%

This page is provided by Altmetric.