↓ Skip to main content

Combinatorial Algorithms

Overview of attention for book
Cover of 'Combinatorial Algorithms'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Speeding Up Cover Time of Sparse Graphs Using Local Knowledge
  3. Altmetric Badge
    Chapter 2 Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width
  4. Altmetric Badge
    Chapter 3 A Fast Scaling Algorithm for the Weighted Triangle-Free 2-Matching Problem
  5. Altmetric Badge
    Chapter 4 1-Page and 2-Page Drawings with Bounded Number of Crossings per Edge
  6. Altmetric Badge
    Chapter 5 Longest Common Extensions in Partial Words
  7. Altmetric Badge
    Chapter 6 Adding Isolated Vertices Makes Some Online Algorithms Optimal
  8. Altmetric Badge
    Chapter 7 Gray Codes for AT-Free Orders via Antimatroids
  9. Altmetric Badge
    Chapter 8 Enumerating Cyclic Orientations of a Graph
  10. Altmetric Badge
    Chapter 9 Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs
  11. Altmetric Badge
    Chapter 10 Combinatorial Properties of Full-Flag Johnson Graphs
  12. Altmetric Badge
    Chapter 11 List Colouring and Partial List Colouring of Graphs On-line
  13. Altmetric Badge
    Chapter 12 About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings
  14. Altmetric Badge
    Chapter 13 Dynamic Subtrees Queries Revisited: The Depth First Tour Tree
  15. Altmetric Badge
    Chapter 14 Schröder Partitions and Schröder Tableaux
  16. Altmetric Badge
    Chapter 15 Algorithmic Aspects of the S-Labeling Problem
  17. Altmetric Badge
    Chapter 16 Contagious Sets in Dense Graphs
  18. Altmetric Badge
    Chapter 17 Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time
  19. Altmetric Badge
    Chapter 18 On the Complexity of Rainbow Coloring Problems
  20. Altmetric Badge
    Chapter 19 How to Design Graphs with Low Forwarding Index and Limited Number of Edges
  21. Altmetric Badge
    Chapter 20 Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs
  22. Altmetric Badge
    Chapter 21 Fast Multiple Order-Preserving Matching Algorithms
  23. Altmetric Badge
    Chapter 22 Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
  24. Altmetric Badge
    Chapter 23 A Faster FPTAS for the Unbounded Knapsack Problem
  25. Altmetric Badge
    Chapter 24 Computational Complexity of Distance Edge Labeling
  26. Altmetric Badge
    Chapter 25 1.5-Approximation Algorithm for the 2-Convex Recoloring Problem
  27. Altmetric Badge
    Chapter 26 Computing the BWT and the LCP Array in Constant Space
  28. Altmetric Badge
    Chapter 27 EERTREE: An Efficient Data Structure for Processing Palindromes in Strings
  29. Altmetric Badge
    Chapter 28 On the Zero Forcing Number of Bijection Graphs
  30. Altmetric Badge
    Chapter 29 The k-Leaf Spanning Tree Problem Admits a Klam Value of 39
Attention for Chapter 15: Algorithmic Aspects of the S-Labeling Problem
Altmetric Badge

Readers on

mendeley
2 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
Algorithmic Aspects of the S-Labeling Problem
Chapter number 15
Book title
Combinatorial Algorithms
Published by
Springer, Cham, October 2015
DOI 10.1007/978-3-319-29516-9_15
Book ISBNs
978-3-31-929515-2, 978-3-31-929516-9
Authors

Guillaume Fertin, Irena Rusu, Stéphane Vialette

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 2 100%
Readers by discipline Count As %
Computer Science 2 100%