Skip to main content
SpringerLink
Log in

Matching in Dynamic Graphs

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Algorithms

  • 94 Accesses

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

Access this chapter

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Recommended Reading

  1. Anand A, Baswana S, Gupta M, Sen S (2012) Maintaining approximate maximum weighted matching in fully dynamic graphs. In: FSTTCS, Hyderabad, pp 257–266

    Google Scholar 

  2. Gupta M, Peng R (2013) Fully dynamic (1+e)-approximate matchings. In: FOCS, Berkeley, pp 548–557

    Google Scholar 

  3. Ivkovic Z, Lloyd EL (1994) Fully dynamic maintenance of vertex cover. In: WG ’93: proceedings of the 19th international workshop on graph-theoretic concepts in computer science, Utrecht. Springer, London, pp 99–111

    Chapter  Google Scholar 

  4. Lovasz L, Plummer M (1986) Matching theory. AMS Chelsea Publishing/North-Holland, Amsterdam/ New York

    MATH  Google Scholar 

  5. Micali S, Vazirani VV (1980) An \(O(\sqrt{(\vert V \vert )}\vert E\vert )\) algorithm for finding maximum matching in general graphs. In: FOCS, Syracuse, pp 17–27

    Google Scholar 

  6. Neiman O, Solomon S (2013) Simple deterministic algorithms for fully dynamic maximal matching. In: STOC, Palo Alto, pp 745–754

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology (IIT), Kanpur, India

    Surender Baswana

  2. Indian Institute of Technology (IIT) Delhi, Hauz Khas, New Delhi, India

    Manoj Gupta & Sandeep Sen

Authors
  1. Surender Baswana
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manoj Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sandeep Sen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Surender Baswana .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Baswana, S., Gupta, M., Sen, S. (2016). Matching in Dynamic Graphs. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_567

Download citation

Publish with us

Policies and ethics

Search

Navigation