Skip to main content
SpringerLink
Log in
Book cover

Combinatorial Algorithms

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

  • Conference proceedings
  • © 2012

Overview

Editors:
  1. S. Arumugam

    1. Kalasalingam University, Krishanakoil, India

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. W. F. Smyth

    1. Algorithms Research Group, Department of Computing & Software, McMaster University, Hamilton, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Fast-track conference proceedings
  • State-of-the-art research
  • Up-to-date results

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 7643)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: IWOCA 2012.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (32 papers)

  1. Front Matter

    Download chapter PDF

  2. Bounds on Quasi-Completeness

    • Malay Bhattacharyya, Sanghamitra Bandyopadhyay
    Pages 1-5

  3. Infinite Random Geometric Graphs from the Hexagonal Metric

    • Anthony Bonato, Jeannette Janssen
    Pages 6-19

  4. Saving on Phases: Parameterized Approximation for Total Vertex Cover

    • Henning Fernau
    Pages 20-31

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

    • Florent Foucaud, Matjaž KovÅ¡e
    Pages 32-45

  6. Disjoint Set Forest Digraph Representation for an Efficient Dominator Tree Construction

    • Wojciech Fraczak, Andrew Miller
    Pages 46-59

  7. On Some Properties of Doughnut Graphs

    • Md. Rezaul Karim, Md. Jawaherul Alam, Md. Saidur Rahman
    Pages 60-64

  8. On the Steiner Radial Number of Graphs

    • K. M. Kathiresan, S. Arockiaraj, R. Gurusamy, K. Amutha
    Pages 65-72

  9. Further Results on the Mycielskian of Graphs

    • T. Kavaskar
    Pages 73-75

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

    • Niraj Ramesh Dayama, Ketki Kulkarni
    Pages 76-80

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

    • Jay Mahadeokar, Sanjeev Saxena
    Pages 81-85

  12. Acyclic Coloring with Few Division Vertices

    • Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Sue Whitesides
    Pages 86-99

  13. Degree Associated Edge Reconstruction Number

    • S. Monikandan, S. Sundar Raj
    Pages 100-109

  14. Touring Polygons: An Approximation Algorithm

    • Amirhossein Mozafari, Alireza Zarei
    Pages 110-121

  15. Super Connectivity of the Generalized Mycielskian of Graphs

    • S. Francis Raj
    Pages 122-124

  16. A Graph Radio k-Coloring Algorithm

    • Laxman Saha, Pratima Panigrahi
    Pages 125-129

  17. Maximum Order of a Planar Oclique Is 15

    • Sagnik Sen
    Pages 130-142

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

    • Shanmugasundaram Jeevadoss, Appu Muthusamy
    Pages 143-147

  19. Incomparability Graphs of Lattices II

    • Meenakshi Wasadikar, Pradnya Survase
    Pages 148-161

  20. On Antimagic Labeling of Odd Regular Graphs

    • Tao-Ming Wang, Guang-Hui Zhang
    Pages 162-168
Back to top

Other volumes

  1. Combinatorial Algorithms

Keywords

About this book

This book constitutes the thoroughly referred post-workshop proceedings of the 23rd International Workshop on Combinatorial Algorithms, IWOCA 2012, held in Krishnankoil, Tamil Nadu, India, in July 2012. The 32 revised full papers presented were carefully reviewed and selected from a total of 88 submissions. The papers are organized in topical sections in algorithms and data Structures, applications (including Bioinformatics, Networking, etc.), combinatorics of words and strings, combinatorial optimization, combinatorial enumeration, decompositions and combinatorial designs, complexity theory (structural and computational), computational biology and graph theory and combinatorics submissions.

Editors and Affiliations

  • Kalasalingam University, Krishanakoil, India

    S. Arumugam

  • Algorithms Research Group, Department of Computing & Software, McMaster University, Hamilton, Canada

    W. F. Smyth

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation