Combinatorial Algorithms

23rd International Workshop, IWOCA 2012, Tamil Nadu, India, July 19-21, 2012, Revised Selected Papers

Editors:

ISBN: 978-3-642-35925-5 (Print) 978-3-642-35926-2 (Online)

Table of contents (32 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. No Access

    Book Chapter

    Pages 1-5

    Bounds on Quasi-Completeness

  3. No Access

    Book Chapter

    Pages 6-19

    Infinite Random Geometric Graphs from the Hexagonal Metric

  4. No Access

    Book Chapter

    Pages 20-31

    Saving on Phases: Parameterized Approximation for Total Vertex Cover

  5. No Access

    Book Chapter

    Pages 32-45

    On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths

  6. No Access

    Book Chapter

    Pages 46-59

    Disjoint Set Forest Digraph Representation for an Efficient Dominator Tree Construction

  7. No Access

    Book Chapter

    Pages 60-64

    On Some Properties of Doughnut Graphs

  8. No Access

    Book Chapter

    Pages 65-72

    On the Steiner Radial Number of Graphs

  9. No Access

    Book Chapter

    Pages 73-75

    Further Results on the Mycielskian of Graphs

  10. No Access

    Book Chapter

    Pages 76-80

    Approaches and Mathematical Models for Robust Solutions to Optimization Problems with Stochastic Problem Data Instances

  11. No Access

    Book Chapter

    Pages 81-85

    Faster Replacement Paths Algorithm for Undirected, Positive Integer Weighted Graphs with Small Diameter

  12. No Access

    Book Chapter

    Pages 86-99

    Acyclic Coloring with Few Division Vertices

  13. No Access

    Book Chapter

    Pages 100-109

    Degree Associated Edge Reconstruction Number

  14. No Access

    Book Chapter

    Pages 110-121

    Touring Polygons: An Approximation Algorithm

  15. No Access

    Book Chapter

    Pages 122-124

    Super Connectivity of the Generalized Mycielskian of Graphs

  16. No Access

    Book Chapter

    Pages 125-129

    A Graph Radio k-Coloring Algorithm

  17. No Access

    Book Chapter

    Pages 130-142

    Maximum Order of a Planar Oclique Is 15

  18. No Access

    Book Chapter

    Pages 143-147

    Sufficient Condition for {C 4, C 2t } - Decomposition of K 2m,2n – An Improved Bound

  19. No Access

    Book Chapter

    Pages 148-161

    Incomparability Graphs of Lattices II

  20. No Access

    Book Chapter

    Pages 162-168

    On Antimagic Labeling of Odd Regular Graphs

  21. No Access

    Book Chapter

    Pages 169-181

    A Graph Theoretic Model to Solve the Approximate String Matching Problem Allowing for Translocations

previous Page of 2