d-Regular Bipartite Graphs When d Is Small.">d-Regular Bipartite Graphs When d Is Small., dblp, computer science, bibliography, knowledge graph, author, editor, publication, conference, journal, book, thesis, database, collection, open data, bibtex">

default search action

combined dblp search
author search
venue search
publication search

ask others

"A New NC-Algorithm for Finding a Perfect Matching in d-Regular ..."

Raghav Kulkarni (2006)

> Home

Details and statistics

DOI: 10.1007/11758471_30

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ciac/Kulkarni06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ciac/Kulkarni06
Raghav Kulkarni:
A New NC-Algorithm for Finding a Perfect Matching in d-Regular Bipartite Graphs When d Is Small. CIAC 2006: 308-319

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.