Path problems in skew-symmetric graphs:
Abstract: "We study path problems in skew-symmetric graphs. These problems generalize the standard graph reachability and shortest paths problems. We develop duality theory for the skew-symmetric problems and use it to design efficient algorithms for the problems. The algorithms presented are c...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Stanford, Calif.
1993
|
| Series: | Stanford University / Computer Science Department: Report STAN CS
1489 |
| Subjects: | |
| Summary: | Abstract: "We study path problems in skew-symmetric graphs. These problems generalize the standard graph reachability and shortest paths problems. We develop duality theory for the skew-symmetric problems and use it to design efficient algorithms for the problems. The algorithms presented are competitive with the fastest algorithms for the standard problems." |
| Physical Description: | 31 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009041459 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940227s1993 |||| 00||| eng d | ||
| 035 | |a (OCoLC)31371852 | ||
| 035 | |a (DE-599)BVBBV009041459 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Goldberg, Andrew V. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Path problems in skew-symmetric graphs |c Andrew V. Goldberg ; Alexander V. Karzanov |
| 264 | 1 | |a Stanford, Calif. |c 1993 | |
| 300 | |a 31 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN CS |v 1489 | |
| 520 | 3 | |a Abstract: "We study path problems in skew-symmetric graphs. These problems generalize the standard graph reachability and shortest paths problems. We develop duality theory for the skew-symmetric problems and use it to design efficient algorithms for the problems. The algorithms presented are competitive with the fastest algorithms for the standard problems." | |
| 650 | 4 | |a Graph theory | |
| 700 | 1 | |a Karzanov, Alexander V. |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: Report STAN CS |t Stanford University |v 1489 |w (DE-604)BV008928280 |9 1489 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005982783 | ||
Record in the Search Index
| _version_ | 1804123396258136064 |
|---|---|
| any_adam_object | |
| author | Goldberg, Andrew V. Karzanov, Alexander V. |
| author_facet | Goldberg, Andrew V. Karzanov, Alexander V. |
| author_role | aut aut |
| author_sort | Goldberg, Andrew V. |
| author_variant | a v g av avg a v k av avk |
| building | Verbundindex |
| bvnumber | BV009041459 |
| ctrlnum | (OCoLC)31371852 (DE-599)BVBBV009041459 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01335nam a2200301 cb4500</leader><controlfield tag="001">BV009041459</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940227s1993 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31371852</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009041459</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Goldberg, Andrew V.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Path problems in skew-symmetric graphs</subfield><subfield code="c">Andrew V. Goldberg ; Alexander V. Karzanov</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">31 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Stanford University / Computer Science Department: Report STAN CS</subfield><subfield code="v">1489</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We study path problems in skew-symmetric graphs. These problems generalize the standard graph reachability and shortest paths problems. We develop duality theory for the skew-symmetric problems and use it to design efficient algorithms for the problems. The algorithms presented are competitive with the fastest algorithms for the standard problems."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Karzanov, Alexander V.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1489</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1489</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005982783</subfield></datafield></record></collection> |
| id | DE-604.BV009041459 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:29:06Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005982783 |
| oclc_num | 31371852 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 31 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN CS |
| spelling | Goldberg, Andrew V. Verfasser aut Path problems in skew-symmetric graphs Andrew V. Goldberg ; Alexander V. Karzanov Stanford, Calif. 1993 31 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN CS 1489 Abstract: "We study path problems in skew-symmetric graphs. These problems generalize the standard graph reachability and shortest paths problems. We develop duality theory for the skew-symmetric problems and use it to design efficient algorithms for the problems. The algorithms presented are competitive with the fastest algorithms for the standard problems." Graph theory Karzanov, Alexander V. Verfasser aut Computer Science Department: Report STAN CS Stanford University 1489 (DE-604)BV008928280 1489 |
| spellingShingle | Goldberg, Andrew V. Karzanov, Alexander V. Path problems in skew-symmetric graphs Graph theory |
| title | Path problems in skew-symmetric graphs |
| title_auth | Path problems in skew-symmetric graphs |
| title_exact_search | Path problems in skew-symmetric graphs |
| title_full | Path problems in skew-symmetric graphs Andrew V. Goldberg ; Alexander V. Karzanov |
| title_fullStr | Path problems in skew-symmetric graphs Andrew V. Goldberg ; Alexander V. Karzanov |
| title_full_unstemmed | Path problems in skew-symmetric graphs Andrew V. Goldberg ; Alexander V. Karzanov |
| title_short | Path problems in skew-symmetric graphs |
| title_sort | path problems in skew symmetric graphs |
| topic | Graph theory |
| topic_facet | Graph theory |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT goldbergandrewv pathproblemsinskewsymmetricgraphs AT karzanovalexanderv pathproblemsinskewsymmetricgraphs |