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

Combinatorial Algorithms

Overview of attention for book
Cover of 'Combinatorial Algorithms'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Bounds on Quasi-Completeness
  3. Altmetric Badge
    Chapter 2 Infinite Random Geometric Graphs from the Hexagonal Metric
  4. Altmetric Badge
    Chapter 3 Saving on Phases: Parameterized Approximation for Total Vertex Cover
  5. Altmetric Badge
    Chapter 4 On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths
  6. Altmetric Badge
    Chapter 5 Disjoint Set Forest Digraph Representation for an Efficient Dominator Tree Construction
  7. Altmetric Badge
    Chapter 6 On Some Properties of Doughnut Graphs
  8. Altmetric Badge
    Chapter 7 On the Steiner Radial Number of Graphs
  9. Altmetric Badge
    Chapter 8 Further Results on the Mycielskian of Graphs
  10. Altmetric Badge
    Chapter 9 Approaches and Mathematical Models for Robust Solutions to Optimization Problems with Stochastic Problem Data Instances
  11. Altmetric Badge
    Chapter 10 Faster Replacement Paths Algorithm for Undirected, Positive Integer Weighted Graphs with Small Diameter
  12. Altmetric Badge
    Chapter 11 Acyclic Coloring with Few Division Vertices
  13. Altmetric Badge
    Chapter 12 Degree Associated Edge Reconstruction Number
  14. Altmetric Badge
    Chapter 13 Touring Polygons: An Approximation Algorithm
  15. Altmetric Badge
    Chapter 14 Super Connectivity of the Generalized Mycielskian of Graphs
  16. Altmetric Badge
    Chapter 15 A Graph Radio k -Coloring Algorithm
  17. Altmetric Badge
    Chapter 16 Maximum Order of a Planar Oclique Is 15
  18. Altmetric Badge
    Chapter 17 Sufficient Condition for { C 4 , C 2 t } - Decomposition of K 2 m ,2 n – An Improved Bound
  19. Altmetric Badge
    Chapter 18 Incomparability Graphs of Lattices II
  20. Altmetric Badge
    Chapter 19 On Antimagic Labeling of Odd Regular Graphs
  21. Altmetric Badge
    Chapter 20 A Graph Theoretic Model to Solve the Approximate String Matching Problem Allowing for Translocations
  22. Altmetric Badge
    Chapter 21 Deterministic Fuzzy Automata on Fuzzy Regular ω -Languages
  23. Altmetric Badge
    Chapter 22 Border Array for Structural Strings
  24. Altmetric Badge
    Chapter 23 Computing the Partial Word Avoidability Indices of Ternary Patterns
  25. Altmetric Badge
    Chapter 24 Computing a Longest Common Palindromic Subsequence
  26. Altmetric Badge
    Chapter 25 Multiset, Set and Numerically Decipherable Codes over Directed Figures
  27. Altmetric Badge
    Chapter 26 A Sequential Recursive Implementation of Dead-Zone Single Keyword Pattern Matching
  28. Altmetric Badge
    Chapter 27 A Catalogue of Algorithms for Building Weak Heaps
  29. Altmetric Badge
    Chapter 28 On Counting Range Maxima Points in Plane
  30. Altmetric Badge
    Chapter 29 Indexing Highly Repetitive Collections
  31. Altmetric Badge
    Chapter 30 Range Extremum Queries
  32. Altmetric Badge
    Chapter 31 Design and Analysis of a Tree-Backtracking Algorithm for Multiset and Pure Permutations
  33. Altmetric Badge
    Chapter 32 GRP_CH Heuristic for Generating Random Simple Polygon
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 X user

Citations

dimensions_citation
4 Dimensions
Summary X 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.
Title
Combinatorial Algorithms
Published by
Springer Berlin Heidelberg, December 2012
DOI 10.1007/978-3-642-35926-2
ISBNs
978-3-64-235925-5, 978-3-64-235926-2
Editors

Arumugam, S., Smyth, W. F.

View on publisher site
X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.

This page is provided by Altmetric.