| Title: | Goel, Ashish(1-STF-MGE); Kapralov, Michael(1-STF-CPE); Khanna, Sanjeev(1-PA-C): Perfect matchings in O(n log n) time in regular bipartite graphs. (English summary). - STOC'10-Proceedings of the 2010 ACM International Symposium on Theory of Computing, 39-46, ACM, New York, 2010 |
|---|
| Authors: | ID Vesel, Aleksander (Author) |
|---|
| Files: |  http://www.ams.org/mathscinet/pdf/2743252.pdf
|
|---|
| Language: | English |
|---|
| Work type: | Not categorized |
|---|
| Typology: | 1.19 - Review, Book Review, Critique |
|---|
| Organization: | FNM - Faculty of Natural Sciences and Mathematics
|
|---|
| Year of publishing: | 2011 |
|---|
| Number of pages: | MR2743252 |
|---|
| PID: | 20.500.12556/DKUM-51944  |
|---|
| UDC: | 519.17:004(049.3) |
|---|
| COBISS.SI-ID: | 16144473 |
|---|
| NUK URN: | URN:SI:UM:DK:JPICTZDE |
|---|
| Publication date in DKUM: | 10.07.2015 |
|---|
| Views: | 905 |
|---|
| Downloads: | 20 |
|---|
| Metadata: |    |
|---|
| Categories: | Misc.
|
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
