The directed subgraph homeomorphism problem:
The set of pattern graphs for which the directed subgraph homeomorphism problem is NP-complete is characterized. A polynomial time algorithm is given for the remaining cases. The restricted problem where the input graph is a directed acyclic graph is in polynomial time for all pattern graphs and an...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Ithaca, New York
1978
|
| Schriftenreihe: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
342 |
| Schlagworte: | |
| Zusammenfassung: | The set of pattern graphs for which the directed subgraph homeomorphism problem is NP-complete is characterized. A polynomial time algorithm is given for the remaining cases. The restricted problem where the input graph is a directed acyclic graph is in polynomial time for all pattern graphs and an algorithm is given. |
| Beschreibung: | 17 Sp. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009891648 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 941109s1978 |||| 00||| engod | ||
| 035 | |a (OCoLC)63574273 | ||
| 035 | |a (DE-599)BVBBV009891648 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Fortune, Steven |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The directed subgraph homeomorphism problem |c Steve Fortune ; John Hopcroft ; James Wyllie |
| 264 | 1 | |a Ithaca, New York |c 1978 | |
| 300 | |a 17 Sp. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |v 342 | |
| 520 | 3 | |a The set of pattern graphs for which the directed subgraph homeomorphism problem is NP-complete is characterized. A polynomial time algorithm is given for the remaining cases. The restricted problem where the input graph is a directed acyclic graph is in polynomial time for all pattern graphs and an algorithm is given. | |
| 650 | 4 | |a Homeomorphisms | |
| 650 | 4 | |a Pattern recognition systems | |
| 700 | 1 | |a Hopcroft, John E. |d 1939- |e Verfasser |0 (DE-588)112071481 |4 aut | |
| 700 | 1 | |a Wyllie, James |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 342 |w (DE-604)BV006185504 |9 342 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006549386 | ||
Datensatz im Suchindex
| _version_ | 1804124249490718720 |
|---|---|
| any_adam_object | |
| author | Fortune, Steven Hopcroft, John E. 1939- Wyllie, James |
| author_GND | (DE-588)112071481 |
| author_facet | Fortune, Steven Hopcroft, John E. 1939- Wyllie, James |
| author_role | aut aut aut |
| author_sort | Fortune, Steven |
| author_variant | s f sf j e h je jeh j w jw |
| building | Verbundindex |
| bvnumber | BV009891648 |
| ctrlnum | (OCoLC)63574273 (DE-599)BVBBV009891648 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01445nam a2200325 cb4500</leader><controlfield tag="001">BV009891648</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">941109s1978 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)63574273</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009891648</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-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Fortune, Steven</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The directed subgraph homeomorphism problem</subfield><subfield code="c">Steve Fortune ; John Hopcroft ; James Wyllie</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, New York</subfield><subfield code="c">1978</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">17 Sp.</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">Cornell University <Ithaca, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">342</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The set of pattern graphs for which the directed subgraph homeomorphism problem is NP-complete is characterized. A polynomial time algorithm is given for the remaining cases. The restricted problem where the input graph is a directed acyclic graph is in polynomial time for all pattern graphs and an algorithm is given.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Homeomorphisms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Pattern recognition systems</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hopcroft, John E.</subfield><subfield code="d">1939-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)112071481</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wyllie, James</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">Cornell University <Ithaca, NY></subfield><subfield code="v">342</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">342</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006549386</subfield></datafield></record></collection> |
| id | DE-604.BV009891648 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:42:40Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006549386 |
| oclc_num | 63574273 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 17 Sp. |
| publishDate | 1978 |
| publishDateSearch | 1978 |
| publishDateSort | 1978 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
| spelling | Fortune, Steven Verfasser aut The directed subgraph homeomorphism problem Steve Fortune ; John Hopcroft ; James Wyllie Ithaca, New York 1978 17 Sp. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 342 The set of pattern graphs for which the directed subgraph homeomorphism problem is NP-complete is characterized. A polynomial time algorithm is given for the remaining cases. The restricted problem where the input graph is a directed acyclic graph is in polynomial time for all pattern graphs and an algorithm is given. Homeomorphisms Pattern recognition systems Hopcroft, John E. 1939- Verfasser (DE-588)112071481 aut Wyllie, James Verfasser aut Department of Computer Science: Technical report Cornell University <Ithaca, NY> 342 (DE-604)BV006185504 342 |
| spellingShingle | Fortune, Steven Hopcroft, John E. 1939- Wyllie, James The directed subgraph homeomorphism problem Homeomorphisms Pattern recognition systems |
| title | The directed subgraph homeomorphism problem |
| title_auth | The directed subgraph homeomorphism problem |
| title_exact_search | The directed subgraph homeomorphism problem |
| title_full | The directed subgraph homeomorphism problem Steve Fortune ; John Hopcroft ; James Wyllie |
| title_fullStr | The directed subgraph homeomorphism problem Steve Fortune ; John Hopcroft ; James Wyllie |
| title_full_unstemmed | The directed subgraph homeomorphism problem Steve Fortune ; John Hopcroft ; James Wyllie |
| title_short | The directed subgraph homeomorphism problem |
| title_sort | the directed subgraph homeomorphism problem |
| topic | Homeomorphisms Pattern recognition systems |
| topic_facet | Homeomorphisms Pattern recognition systems |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT fortunesteven thedirectedsubgraphhomeomorphismproblem AT hopcroftjohne thedirectedsubgraphhomeomorphismproblem AT wylliejames thedirectedsubgraphhomeomorphismproblem |