An edition of Recent advances in algorithms and combinatorics (2002)

Recent Advances in Algorithms and Combinatorics

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read
Cover of: Recent Advances in Algorithms and Combinatorics by
Not in Library

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today
Notes
  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read
Notes

Check nearby libraries

Buy this book

Last edited by ImportBot
July 28, 2014 | History
Edit
An edition of Recent advances in algorithms and combinatorics (2002)

Recent Advances in Algorithms and Combinatorics

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read

This edition doesn't have a description yet. Can you add one?

Publish Date
Publisher
Springer
Language
English
Pages
368

Check nearby libraries

Buy this book

Previews available in: English

Subjects
Combinatorial analysis

Showing 1 featured edition. View all 1 editions?

Edition Availability
Cover of: Recent Advances in Algorithms and Combinatorics
Recent Advances in Algorithms and Combinatorics
November 22, 2002, Springer
in English
  • Not in Library
Libraries near you: WorldCat

Add another edition?

Book Details

First Sentence

"A set M of edges of a graph G is a matching of G if each vertex of G is incident with at most one edge of M and a perfect, matching of G if each vertex of G is incident with precisely one edge of M."

ID Numbers

Open Library
OL7448933M
Internet Archive
realworldcamerar00reed
ISBN 10
0387954341
ISBN 13
9780387954349
Goodreads
1206282

Source records

Internet Archive item record

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON
July 28, 2014 Created by ImportBot import new book