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

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management

Overview of attention for book
Cover of 'Frontiers in Algorithmics and Algorithmic Aspects in Information and Management'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Optimal Binary Representation of Mosaic Floorplans and Baxter Permutations
  3. Altmetric Badge
    Chapter 2 Succinct Strictly Convex Greedy Drawing of 3-Connected Plane Graphs
  4. Altmetric Badge
    Chapter 3 Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance
  5. Altmetric Badge
    Chapter 4 Voronoi Diagram with Visual Restriction
  6. Altmetric Badge
    Chapter 5 Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region
  7. Altmetric Badge
    Chapter 6 On Covering Points with Minimum Turns
  8. Altmetric Badge
    Chapter 7 On Envy-Free Pareto Efficient Pricing
  9. Altmetric Badge
    Chapter 8 Online Pricing for Multi-type of Items
  10. Altmetric Badge
    Chapter 9 Algorithms with Limited Number of Preemptions for Scheduling on Parallel Machines
  11. Altmetric Badge
    Chapter 10 Computing Maximum Non-crossing Matching in Convex Bipartite Graphs
  12. Altmetric Badge
    Chapter 11 Algorithms for Bandwidth Consecutive Multicolorings of Graphs
  13. Altmetric Badge
    Chapter 12 Independent Domination on Tree Convex Bipartite Graphs
  14. Altmetric Badge
    Chapter 13 On-Line Scheduling of Parallel Jobs in Heterogeneous Multiple Clusters
  15. Altmetric Badge
    Chapter 14 On Multiprocessor Temperature-Aware Scheduling Problems
  16. Altmetric Badge
    Chapter 15 Online Minimum Makespan Scheduling with a Buffer
  17. Altmetric Badge
    Chapter 16 A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing
  18. Altmetric Badge
    Chapter 17 Multivariate Polynomial Integration and Differentiation Are Polynomial Time Inapproximable Unless P=NP
  19. Altmetric Badge
    Chapter 18 Some Remarks on the Incompressibility of Width-Parameterized SAT Instances
  20. Altmetric Badge
    Chapter 19 Kernels for Packing and Covering Problems
  21. Altmetric Badge
    Chapter 20 The Worst-Case Upper Bound for Exact 3-Satisfiability with the Number of Clauses as the Parameter
  22. Altmetric Badge
    Chapter 21 Fixed-Parameter Tractability of almost CSP Problem with Decisive Relations
  23. Altmetric Badge
    Chapter 22 On Editing Graphs into 2-Club Clusters
  24. Altmetric Badge
    Chapter 23 Solving Generalized Optimization Problems Subject to SMT Constraints
  25. Altmetric Badge
    Chapter 24 Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition
  26. Altmetric Badge
    Chapter 25 Zero-Sum Flow Numbers of Regular Graphs
  27. Altmetric Badge
    Chapter 26 More Efficient Parallel Integer Sorting
  28. Altmetric Badge
    Chapter 27 Fast Relative Lempel-Ziv Self-index for Similar Sequences
  29. Altmetric Badge
    Chapter 28 A Comparison of Performance Measures via Online Search
  30. Altmetric Badge
    Chapter 29 Online Exploration of All Vertices in a Simple Polygon
  31. Altmetric Badge
    Chapter 30 In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs
  32. Altmetric Badge
    Chapter 31 The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs
  33. Altmetric Badge
    Chapter 32 An Improved Approximation Algorithm for the Bandpass Problem
  34. Altmetric Badge
    Chapter 33 Partial Degree Bounded Edge Packing Problem
  35. Altmetric Badge
    Chapter 34 Erratum: The Approximability of the Exemplar Breakpoint Distance Problem
Attention for Chapter 25: Zero-Sum Flow Numbers of Regular Graphs
Altmetric Badge

Readers on

mendeley
2 Mendeley
Summary
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
Zero-Sum Flow Numbers of Regular Graphs
Chapter number 25
Book title
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management
Published by
Springer, Berlin, Heidelberg, January 2012
DOI 10.1007/978-3-642-29700-7_25
Book ISBNs
978-3-64-229699-4, 978-3-64-229700-7
Authors

Tao-Ming Wang, Shih-Wei Hu, Wang, Tao-Ming, Hu, Shih-Wei

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.