↓ Skip to main content

Frontiers in Algorithmics

Overview of attention for book
Cover of 'Frontiers in Algorithmics'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Algorithms for Queryable Uncertainty
  3. Altmetric Badge
    Chapter 2 Genomic Scaffold Filling: A Progress Report
  4. Altmetric Badge
    Chapter 3 Better Approximation Algorithms for Scaffolding Problems
  5. Altmetric Badge
    Chapter 4 How to Block Blood Flow by Using Elastic Coil
  6. Altmetric Badge
    Chapter 5 Linear Time Algorithm for 1-Center in \(\mathfrak {R}^d\) Under Convex Polyhedral Distance Function
  7. Altmetric Badge
    Chapter 6 Positive Zero Forcing and Edge Clique Coverings
  8. Altmetric Badge
    Chapter 7 Improved Algorithms for Several Parameterized Problems Based on Random Methods
  9. Altmetric Badge
    Chapter 8 Parameterized Algorithms for Maximum Edge Biclique and Related Problems
  10. Altmetric Badge
    Chapter 9 The Scheduling Strategy of Virtual Machine Migration Based on the Gray Forecasting Model
  11. Altmetric Badge
    Chapter 10 A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs
  12. Altmetric Badge
    Chapter 11 Fractional Edge Cover Number of Model RB
  13. Altmetric Badge
    Chapter 12 Breaking Cycle Structure to Improve Lower Bound for Max-SAT
  14. Altmetric Badge
    Chapter 13 On Counting Parameterized Matching and Packing
  15. Altmetric Badge
    Chapter 14 Online Scheduling with Increasing Subsequence Serving Constraint
  16. Altmetric Badge
    Chapter 15 Notes on the \(\frac{6}{5}\) -Approximation Algorithm for One-Sided Scaffold Filling
  17. Altmetric Badge
    Chapter 16 Nonlinear Dimension Reduction by Local Multidimensional Scaling
  18. Altmetric Badge
    Chapter 17 Mechanism Design for One-Facility Location Game with Obnoxious Effects
  19. Altmetric Badge
    Chapter 18 Realtime Channel Recommendation: Switch Smartly While Watching TV
  20. Altmetric Badge
    Chapter 19 Empirical Study of Phase Transition of Hamiltonian Cycle Problem in Random Graphs with Degrees Greater Than One
  21. Altmetric Badge
    Chapter 20 Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles?
  22. Altmetric Badge
    Chapter 21 A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
  23. Altmetric Badge
    Chapter 22 A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan
  24. Altmetric Badge
    Chapter 23 Kernelization of Two Path Searching Problems on Split Graphs
  25. Altmetric Badge
    Chapter 24 The Bounded Batch Scheduling with Common Due Window and Non-identical Size Jobs
  26. Altmetric Badge
    Chapter 25 Parallel Identifying (l,d)-Motifs in Biosequences Using CPU and GPU Computing
  27. Altmetric Badge
    Chapter 26 On the Lower Bounds of Random Max 3 and 4-SAT
  28. Altmetric Badge
    Chapter 27 Finding Disjoint Dense Clubs in an Undirected Graph
Attention for Chapter 20: Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles?
Altmetric Badge

Readers on

mendeley
1 Mendeley
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
Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles?
Chapter number 20
Book title
Frontiers in Algorithmics
Published by
Springer International Publishing, January 2016
DOI 10.1007/978-3-319-39817-4_20
Book ISBNs
978-3-31-939816-7, 978-3-31-939817-4
Authors

Lianrong Pu, Haitao Jiang

Editors

Daming Zhu, Sergey Bereg

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Student > Bachelor 1 100%
Readers by discipline Count As %
Computer Science 1 100%