The complexity of pursuit on a graph:
Abstract: "A robber and k cops choose starting vertices in a graph and move in alternation from vertex to vertex along the edges of the graph; capture occurs if a cop ever shares a vertex with the robber. We give an algorithm to determine if k cops are sufficient to ensure capture on a given gr...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Urbana, Ill.
University of Illinois at Urbana-Champaign, Dept. of Computer Science
1992
|
| Schlagworte: | |
| Zusammenfassung: | Abstract: "A robber and k cops choose starting vertices in a graph and move in alternation from vertex to vertex along the edges of the graph; capture occurs if a cop ever shares a vertex with the robber. We give an algorithm to determine if k cops are sufficient to ensure capture on a given graph. The algorithm is polynomial-time if k is fixed. If k is not fixed and the graph is directed or initial positions are given, we show that the problem is EXPTIME-complete. Similar techniques lead to the PSPACE- and EXPTIME-completeness of some other combinatorial games that were previously only known to be NP- and PSPACE-hard." |
| Beschreibung: | 22 p. ill. 28 cm |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV035638279 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 090721s1992 a||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)26366968 | ||
| 035 | |a (DE-599)BVBBV035638279 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 082 | 0 | |a 510.78 | |
| 088 | |a UIUCDCS-R-92-1754 | ||
| 088 | |a UILU-ENG-92-1734 | ||
| 100 | 1 | |a Goldstein, Arthur S. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The complexity of pursuit on a graph |c by Arthur Goldstein, Edward Reingold |
| 246 | 1 | 3 | |a UIUCDCS R 92-1754 |
| 264 | 1 | |a Urbana, Ill. |b University of Illinois at Urbana-Champaign, Dept. of Computer Science |c 1992 | |
| 300 | |a 22 p. |b ill. |c 28 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | |a Abstract: "A robber and k cops choose starting vertices in a graph and move in alternation from vertex to vertex along the edges of the graph; capture occurs if a cop ever shares a vertex with the robber. We give an algorithm to determine if k cops are sufficient to ensure capture on a given graph. The algorithm is polynomial-time if k is fixed. If k is not fixed and the graph is directed or initial positions are given, we show that the problem is EXPTIME-complete. Similar techniques lead to the PSPACE- and EXPTIME-completeness of some other combinatorial games that were previously only known to be NP- and PSPACE-hard." | ||
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Combinatorial optimization | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Combinatorial optimization | |
| 650 | 4 | |a Computational complexity | |
| 700 | 1 | |a Reingold, Edward M. |e Sonstige |4 oth | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-017693114 | ||
Datensatz im Suchindex
| _version_ | 1804139317868625920 |
|---|---|
| any_adam_object | |
| author | Goldstein, Arthur S. |
| author_facet | Goldstein, Arthur S. |
| author_role | aut |
| author_sort | Goldstein, Arthur S. |
| author_variant | a s g as asg |
| building | Verbundindex |
| bvnumber | BV035638279 |
| ctrlnum | (OCoLC)26366968 (DE-599)BVBBV035638279 |
| dewey-full | 510.78 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 510 - Mathematics |
| dewey-raw | 510.78 |
| dewey-search | 510.78 |
| dewey-sort | 3510.78 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01788nam a2200385 c 4500</leader><controlfield tag="001">BV035638279</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090721s1992 a||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)26366968</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035638279</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510.78</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">UIUCDCS-R-92-1754</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">UILU-ENG-92-1734</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Goldstein, Arthur S.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The complexity of pursuit on a graph</subfield><subfield code="c">by Arthur Goldstein, Edward Reingold</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">UIUCDCS R 92-1754</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Urbana, Ill.</subfield><subfield code="b">University of Illinois at Urbana-Champaign, Dept. of Computer Science</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">22 p.</subfield><subfield code="b">ill.</subfield><subfield code="c">28 cm</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="520" ind1=" " ind2=" "><subfield code="a">Abstract: "A robber and k cops choose starting vertices in a graph and move in alternation from vertex to vertex along the edges of the graph; capture occurs if a cop ever shares a vertex with the robber. We give an algorithm to determine if k cops are sufficient to ensure capture on a given graph. The algorithm is polynomial-time if k is fixed. If k is not fixed and the graph is directed or initial positions are given, we show that the problem is EXPTIME-complete. Similar techniques lead to the PSPACE- and EXPTIME-completeness of some other combinatorial games that were previously only known to be NP- and PSPACE-hard."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Reingold, Edward M.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017693114</subfield></datafield></record></collection> |
| id | DE-604.BV035638279 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T21:42:10Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017693114 |
| oclc_num | 26366968 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 22 p. ill. 28 cm |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| publisher | University of Illinois at Urbana-Champaign, Dept. of Computer Science |
| record_format | marc |
| spelling | Goldstein, Arthur S. Verfasser aut The complexity of pursuit on a graph by Arthur Goldstein, Edward Reingold UIUCDCS R 92-1754 Urbana, Ill. University of Illinois at Urbana-Champaign, Dept. of Computer Science 1992 22 p. ill. 28 cm txt rdacontent n rdamedia nc rdacarrier Abstract: "A robber and k cops choose starting vertices in a graph and move in alternation from vertex to vertex along the edges of the graph; capture occurs if a cop ever shares a vertex with the robber. We give an algorithm to determine if k cops are sufficient to ensure capture on a given graph. The algorithm is polynomial-time if k is fixed. If k is not fixed and the graph is directed or initial positions are given, we show that the problem is EXPTIME-complete. Similar techniques lead to the PSPACE- and EXPTIME-completeness of some other combinatorial games that were previously only known to be NP- and PSPACE-hard." Algorithms Computational complexity Combinatorial optimization Reingold, Edward M. Sonstige oth |
| spellingShingle | Goldstein, Arthur S. The complexity of pursuit on a graph Algorithms Computational complexity Combinatorial optimization |
| title | The complexity of pursuit on a graph |
| title_alt | UIUCDCS R 92-1754 |
| title_auth | The complexity of pursuit on a graph |
| title_exact_search | The complexity of pursuit on a graph |
| title_full | The complexity of pursuit on a graph by Arthur Goldstein, Edward Reingold |
| title_fullStr | The complexity of pursuit on a graph by Arthur Goldstein, Edward Reingold |
| title_full_unstemmed | The complexity of pursuit on a graph by Arthur Goldstein, Edward Reingold |
| title_short | The complexity of pursuit on a graph |
| title_sort | the complexity of pursuit on a graph |
| topic | Algorithms Computational complexity Combinatorial optimization |
| topic_facet | Algorithms Computational complexity Combinatorial optimization |
| work_keys_str_mv | AT goldsteinarthurs thecomplexityofpursuitonagraph AT reingoldedwardm thecomplexityofpursuitonagraph AT goldsteinarthurs uiucdcsr921754 AT reingoldedwardm uiucdcsr921754 |