Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 2000: Computing and Combinatorics pp 34–43Cite as

Maximum Induced Matchings of Random Cubic Graphs

  • Conference paper
  • First Online:

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

Abstract

In this paper we present a heuristic for finding a large induced matching \( \mathcal{M} \) of cubic graphs. We analyse the performance of this heuristic, which is a random greedy algorithm, on random cubic graphs using differential equations and obtain a lower bound on the expected size of the induced matching returned by the algorithm. The corresponding upper bound is derived by means of a direct expectation argument. We prove that \( \mathcal{M} \) asymptotically almost surely satisfies 0:2704n < |\( \mathcal{M} \) | < 0:2821n.

Supported by the Australian Research Council

Supported by EPSRC grant GR/L/77089

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bollobás, B.: Random Graphs. Academic Press, London, 1985.

    MATH  Google Scholar 

  2. Cameron, K.: Induced Matchings. Discrete Applied Math., 24:97–102, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  3. Duckworth, W., Manlove, D. and Zito, M.: On the Approximability of the Maximum Induced Matching Problem. J. of Combinatorial Optimisation (Submitted).

    Google Scholar 

  4. Duckworth, W. and Wormald, N.C.: Minimum Independent Dominating Sets of Random Cubic Graphs. Random Structures and Algorithms (Submitted).

    Google Scholar 

  5. Erdös, E.: Problems and Results in Combinatorial Analysis and Graph Theory. Discrete Math., 72:81–92, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  6. Faudree, R.J., Gyárfas, A., Schelp, R.H. and Tuza, Z.: Induced Matchings in Bipartite Graphs. Discrete Math., 78:83–87, 1989.

    Article  MathSciNet  MATH  Google Scholar 

  7. Golumbic, M.C. and Laskar, R.C.: Irredundancy in Circular Arc Graphs. Discrete Applied Math., 44:79–89, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  8. Golumbic, M.C. and Lewenstein, M.: New Results on Induced Matchings. Discrete Applied Math., 101:157–165, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  9. Liu, J. and Zhou, H.: Maximum Induced Matchings in Graphs. Discrete Math., 170:271–281, 1997.

    Article  MathSciNet  Google Scholar 

  10. Steger, A. and Yu, M.: On Induced Matchings. Discrete Math., 120:291–295, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  11. Stockmeyer, L.J. and Vazirani, V.V.: NP-Completeness of Some Generalizations of the Maximum Matching Problem. Inf. Proc. Lett., 15(1):14–19, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  12. Wormald, N.C.: Differential Equations for Random Processes and Random Graphs. In Lectures on Approximation and Randomized Algorithms, 73–155, PWN, Warsaw, 1999. Michal Karoński and Hans-Jürgen Prömel (Eds).

    Google Scholar 

  13. Zito, M.: Induced Matchings in Regular Graphs and Trees. In Proceedings of the 25th International Workshop on Graph Theoretic Concepts in Computer Science, volume 1665 of Lecture Notes in Computer Science, 89–100. Springer-Verlag, 1999.

    Chapter  Google Scholar 

  14. Zito, M.: Randomised Techniques in Combinatorial Algorithmics. PhD thesis, Department of Computer Science, University of Warwick, UK, November 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, University of Melbourne, Australia

    William Duckworth & Nicholas C. Wormald

  2. Department of Computer Science, University of Liverpool, UK

    Michele Zito

Authors
  1. William Duckworth
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nicholas C. Wormald
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michele Zito
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, University of Minnesota, MN 55455, Minneapolis, USA

    Ding-Zhu Du

  2. Department of Computer Science and Software Engineering, University of Newcastle, Callaghan, NSW 2308, Australia

    Peter Eades  & Vladimir Estivill-Castro  & 

  3. School of Computer Science and Engineering, University of Newcastle, NSW 2052, Sydney, Australia

    Xuemin Lin  & Arun Sharma  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Duckworth, W., Wormald, N.C., Zito, M. (2000). Maximum Induced Matchings of Random Cubic Graphs. In: Du, DZ., Eades, P., Estivill-Castro, V., Lin, X., Sharma, A. (eds) Computing and Combinatorics. COCOON 2000. Lecture Notes in Computer Science, vol 1858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44968-X_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-44968-X_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67787-1

  • Online ISBN: 978-3-540-44968-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation