Finding good 2-partitions of digraphs I. Hereditary properties
We study the complexity of deciding whether a given digraph D has a vertex-partition into two disjoint subdigraphs with given structural properties. Let H and E denote the following two sets of natural properties of digraphs: H = {acyclic, complete, arcless, oriented (no 2-cycle), semicomplete, symm...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Bang-Jensen, J. [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2016transfer abstract |
|---|
| Schlagwörter: |
|---|
| Umfang: |
10 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries - Schweiss, Rüdiger ELSEVIER, 2015transfer abstract, the journal of the EATCS, Amsterdam [u.a.] |
|---|---|
| Übergeordnetes Werk: |
volume:636 ; year:2016 ; day:11 ; month:07 ; pages:85-94 ; extent:10 |
| Links: |
|---|
| DOI / URN: |
10.1016/j.tcs.2016.05.029 |
|---|
| Katalog-ID: |
ELV040055604 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | ELV040055604 | ||
| 003 | DE-627 | ||
| 005 | 20230625230716.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 180603s2016 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1016/j.tcs.2016.05.029 |2 doi | |
| 028 | 5 | 2 | |a GBVA2016010000017.pica |
| 035 | |a (DE-627)ELV040055604 | ||
| 035 | |a (ELSEVIER)S0304-3975(16)30165-7 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | |a 004 | |
| 082 | 0 | 4 | |a 004 |q DE-600 |
| 082 | 0 | 4 | |a 620 |q VZ |
| 082 | 0 | 4 | |a 690 |q VZ |
| 084 | |a 50.92 |2 bkl | ||
| 100 | 1 | |a Bang-Jensen, J. |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Finding good 2-partitions of digraphs I. Hereditary properties |
| 264 | 1 | |c 2016transfer abstract | |
| 300 | |a 10 | ||
| 336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
| 337 | |a nicht spezifiziert |b z |2 rdamedia | ||
| 338 | |a nicht spezifiziert |b zu |2 rdacarrier | ||
| 520 | |a We study the complexity of deciding whether a given digraph D has a vertex-partition into two disjoint subdigraphs with given structural properties. Let H and E denote the following two sets of natural properties of digraphs: H = {acyclic, complete, arcless, oriented (no 2-cycle), semicomplete, symmetric, tournament} and E = {strongly connected, connected, minimum out-degree at least 1, minimum in-degree at least 1, minimum semi-degree at least 1, minimum degree at least 1, having an out-branching, having an in-branching}. In this paper, we determine the complexity of deciding, for any fixed pair of positive integers k 1 , k 2 , whether a given digraph has a vertex partition into two digraphs D 1 , D 2 such that | V ( D i ) | ≥ k i and D i has property P i for i = 1 , 2 when P 1 ∈ H and P 2 ∈ H ∪ E . We also classify the complexity of the same problems when restricted to strongly connected digraphs. | ||
| 520 | |a We study the complexity of deciding whether a given digraph D has a vertex-partition into two disjoint subdigraphs with given structural properties. Let H and E denote the following two sets of natural properties of digraphs: H = {acyclic, complete, arcless, oriented (no 2-cycle), semicomplete, symmetric, tournament} and E = {strongly connected, connected, minimum out-degree at least 1, minimum in-degree at least 1, minimum semi-degree at least 1, minimum degree at least 1, having an out-branching, having an in-branching}. In this paper, we determine the complexity of deciding, for any fixed pair of positive integers k 1 , k 2 , whether a given digraph has a vertex partition into two digraphs D 1 , D 2 such that | V ( D i ) | ≥ k i and D i has property P i for i = 1 , 2 when P 1 ∈ H and P 2 ∈ H ∪ E . We also classify the complexity of the same problems when restricted to strongly connected digraphs. | ||
| 650 | 7 | |a Polynomial |2 Elsevier | |
| 650 | 7 | |a Partition |2 Elsevier | |
| 650 | 7 | |a 2-partition |2 Elsevier | |
| 650 | 7 | |a Minimum degree |2 Elsevier | |
| 650 | 7 | |a Feedback vertex set |2 Elsevier | |
| 650 | 7 | |a Acyclic |2 Elsevier | |
| 650 | 7 | |a Out-branching |2 Elsevier | |
| 650 | 7 | |a Oriented |2 Elsevier | |
| 650 | 7 | |a Splitting digraphs |2 Elsevier | |
| 650 | 7 | |a NP-complete |2 Elsevier | |
| 650 | 7 | |a Semicomplete digraph |2 Elsevier | |
| 650 | 7 | |a Tournament |2 Elsevier | |
| 700 | 1 | |a Havet, Frédéric |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |n Elsevier |a Schweiss, Rüdiger ELSEVIER |t Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |d 2015transfer abstract |d the journal of the EATCS |g Amsterdam [u.a.] |w (DE-627)ELV013125583 |
| 773 | 1 | 8 | |g volume:636 |g year:2016 |g day:11 |g month:07 |g pages:85-94 |g extent:10 |
| 856 | 4 | 0 | |u https://doi.org/10.1016/j.tcs.2016.05.029 |3 Volltext |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a GBV_ELV | ||
| 912 | |a SYSFLAG_U | ||
| 912 | |a GBV_ILN_22 | ||
| 912 | |a GBV_ILN_40 | ||
| 936 | b | k | |a 50.92 |j Meerestechnik |q VZ |
| 951 | |a AR | ||
| 952 | |d 636 |j 2016 |b 11 |c 0711 |h 85-94 |g 10 | ||
| 953 | |2 045F |a 004 | ||
| author_variant |
j b j jbj |
|---|---|
| matchkey_str |
bangjensenjhavetfrdric:2016----:idngo2attosfirpshrd |
| hierarchy_sort_str |
2016transfer abstract |
| bklnumber |
50.92 |
| publishDate |
2016 |
| allfields |
10.1016/j.tcs.2016.05.029 doi GBVA2016010000017.pica (DE-627)ELV040055604 (ELSEVIER)S0304-3975(16)30165-7 DE-627 ger DE-627 rakwb eng 004 004 DE-600 620 VZ 690 VZ 50.92 bkl Bang-Jensen, J. verfasserin aut Finding good 2-partitions of digraphs I. Hereditary properties 2016transfer abstract 10 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier We study the complexity of deciding whether a given digraph D has a vertex-partition into two disjoint subdigraphs with given structural properties. Let H and E denote the following two sets of natural properties of digraphs: H = {acyclic, complete, arcless, oriented (no 2-cycle), semicomplete, symmetric, tournament} and E = {strongly connected, connected, minimum out-degree at least 1, minimum in-degree at least 1, minimum semi-degree at least 1, minimum degree at least 1, having an out-branching, having an in-branching}. In this paper, we determine the complexity of deciding, for any fixed pair of positive integers k 1 , k 2 , whether a given digraph has a vertex partition into two digraphs D 1 , D 2 such that | V ( D i ) | ≥ k i and D i has property P i for i = 1 , 2 when P 1 ∈ H and P 2 ∈ H ∪ E . We also classify the complexity of the same problems when restricted to strongly connected digraphs. We study the complexity of deciding whether a given digraph D has a vertex-partition into two disjoint subdigraphs with given structural properties. Let H and E denote the following two sets of natural properties of digraphs: H = {acyclic, complete, arcless, oriented (no 2-cycle), semicomplete, symmetric, tournament} and E = {strongly connected, connected, minimum out-degree at least 1, minimum in-degree at least 1, minimum semi-degree at least 1, minimum degree at least 1, having an out-branching, having an in-branching}. In this paper, we determine the complexity of deciding, for any fixed pair of positive integers k 1 , k 2 , whether a given digraph has a vertex partition into two digraphs D 1 , D 2 such that | V ( D i ) | ≥ k i and D i has property P i for i = 1 , 2 when P 1 ∈ H and P 2 ∈ H ∪ E . We also classify the complexity of the same problems when restricted to strongly connected digraphs. Polynomial Elsevier Partition Elsevier 2-partition Elsevier Minimum degree Elsevier Feedback vertex set Elsevier Acyclic Elsevier Out-branching Elsevier Oriented Elsevier Splitting digraphs Elsevier NP-complete Elsevier Semicomplete digraph Elsevier Tournament Elsevier Havet, Frédéric oth Enthalten in Elsevier Schweiss, Rüdiger ELSEVIER Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries 2015transfer abstract the journal of the EATCS Amsterdam [u.a.] (DE-627)ELV013125583 volume:636 year:2016 day:11 month:07 pages:85-94 extent:10 https://doi.org/10.1016/j.tcs.2016.05.029 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 636 2016 11 0711 85-94 10 045F 004 |
| spelling |
10.1016/j.tcs.2016.05.029 doi GBVA2016010000017.pica (DE-627)ELV040055604 (ELSEVIER)S0304-3975(16)30165-7 DE-627 ger DE-627 rakwb eng 004 004 DE-600 620 VZ 690 VZ 50.92 bkl Bang-Jensen, J. verfasserin aut Finding good 2-partitions of digraphs I. Hereditary properties 2016transfer abstract 10 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier We study the complexity of deciding whether a given digraph D has a vertex-partition into two disjoint subdigraphs with given structural properties. Let H and E denote the following two sets of natural properties of digraphs: H = {acyclic, complete, arcless, oriented (no 2-cycle), semicomplete, symmetric, tournament} and E = {strongly connected, connected, minimum out-degree at least 1, minimum in-degree at least 1, minimum semi-degree at least 1, minimum degree at least 1, having an out-branching, having an in-branching}. In this paper, we determine the complexity of deciding, for any fixed pair of positive integers k 1 , k 2 , whether a given digraph has a vertex partition into two digraphs D 1 , D 2 such that | V ( D i ) | ≥ k i and D i has property P i for i = 1 , 2 when P 1 ∈ H and P 2 ∈ H ∪ E . We also classify the complexity of the same problems when restricted to strongly connected digraphs. We study the complexity of deciding whether a given digraph D has a vertex-partition into two disjoint subdigraphs with given structural properties. Let H and E denote the following two sets of natural properties of digraphs: H = {acyclic, complete, arcless, oriented (no 2-cycle), semicomplete, symmetric, tournament} and E = {strongly connected, connected, minimum out-degree at least 1, minimum in-degree at least 1, minimum semi-degree at least 1, minimum degree at least 1, having an out-branching, having an in-branching}. In this paper, we determine the complexity of deciding, for any fixed pair of positive integers k 1 , k 2 , whether a given digraph has a vertex partition into two digraphs D 1 , D 2 such that | V ( D i ) | ≥ k i and D i has property P i for i = 1 , 2 when P 1 ∈ H and P 2 ∈ H ∪ E . We also classify the complexity of the same problems when restricted to strongly connected digraphs. Polynomial Elsevier Partition Elsevier 2-partition Elsevier Minimum degree Elsevier Feedback vertex set Elsevier Acyclic Elsevier Out-branching Elsevier Oriented Elsevier Splitting digraphs Elsevier NP-complete Elsevier Semicomplete digraph Elsevier Tournament Elsevier Havet, Frédéric oth Enthalten in Elsevier Schweiss, Rüdiger ELSEVIER Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries 2015transfer abstract the journal of the EATCS Amsterdam [u.a.] (DE-627)ELV013125583 volume:636 year:2016 day:11 month:07 pages:85-94 extent:10 https://doi.org/10.1016/j.tcs.2016.05.029 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 636 2016 11 0711 85-94 10 045F 004 |
| allfields_unstemmed |
10.1016/j.tcs.2016.05.029 doi GBVA2016010000017.pica (DE-627)ELV040055604 (ELSEVIER)S0304-3975(16)30165-7 DE-627 ger DE-627 rakwb eng 004 004 DE-600 620 VZ 690 VZ 50.92 bkl Bang-Jensen, J. verfasserin aut Finding good 2-partitions of digraphs I. Hereditary properties 2016transfer abstract 10 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier We study the complexity of deciding whether a given digraph D has a vertex-partition into two disjoint subdigraphs with given structural properties. Let H and E denote the following two sets of natural properties of digraphs: H = {acyclic, complete, arcless, oriented (no 2-cycle), semicomplete, symmetric, tournament} and E = {strongly connected, connected, minimum out-degree at least 1, minimum in-degree at least 1, minimum semi-degree at least 1, minimum degree at least 1, having an out-branching, having an in-branching}. In this paper, we determine the complexity of deciding, for any fixed pair of positive integers k 1 , k 2 , whether a given digraph has a vertex partition into two digraphs D 1 , D 2 such that | V ( D i ) | ≥ k i and D i has property P i for i = 1 , 2 when P 1 ∈ H and P 2 ∈ H ∪ E . We also classify the complexity of the same problems when restricted to strongly connected digraphs. We study the complexity of deciding whether a given digraph D has a vertex-partition into two disjoint subdigraphs with given structural properties. Let H and E denote the following two sets of natural properties of digraphs: H = {acyclic, complete, arcless, oriented (no 2-cycle), semicomplete, symmetric, tournament} and E = {strongly connected, connected, minimum out-degree at least 1, minimum in-degree at least 1, minimum semi-degree at least 1, minimum degree at least 1, having an out-branching, having an in-branching}. In this paper, we determine the complexity of deciding, for any fixed pair of positive integers k 1 , k 2 , whether a given digraph has a vertex partition into two digraphs D 1 , D 2 such that | V ( D i ) | ≥ k i and D i has property P i for i = 1 , 2 when P 1 ∈ H and P 2 ∈ H ∪ E . We also classify the complexity of the same problems when restricted to strongly connected digraphs. Polynomial Elsevier Partition Elsevier 2-partition Elsevier Minimum degree Elsevier Feedback vertex set Elsevier Acyclic Elsevier Out-branching Elsevier Oriented Elsevier Splitting digraphs Elsevier NP-complete Elsevier Semicomplete digraph Elsevier Tournament Elsevier Havet, Frédéric oth Enthalten in Elsevier Schweiss, Rüdiger ELSEVIER Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries 2015transfer abstract the journal of the EATCS Amsterdam [u.a.] (DE-627)ELV013125583 volume:636 year:2016 day:11 month:07 pages:85-94 extent:10 https://doi.org/10.1016/j.tcs.2016.05.029 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 636 2016 11 0711 85-94 10 045F 004 |
| allfieldsGer |
10.1016/j.tcs.2016.05.029 doi GBVA2016010000017.pica (DE-627)ELV040055604 (ELSEVIER)S0304-3975(16)30165-7 DE-627 ger DE-627 rakwb eng 004 004 DE-600 620 VZ 690 VZ 50.92 bkl Bang-Jensen, J. verfasserin aut Finding good 2-partitions of digraphs I. Hereditary properties 2016transfer abstract 10 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier We study the complexity of deciding whether a given digraph D has a vertex-partition into two disjoint subdigraphs with given structural properties. Let H and E denote the following two sets of natural properties of digraphs: H = {acyclic, complete, arcless, oriented (no 2-cycle), semicomplete, symmetric, tournament} and E = {strongly connected, connected, minimum out-degree at least 1, minimum in-degree at least 1, minimum semi-degree at least 1, minimum degree at least 1, having an out-branching, having an in-branching}. In this paper, we determine the complexity of deciding, for any fixed pair of positive integers k 1 , k 2 , whether a given digraph has a vertex partition into two digraphs D 1 , D 2 such that | V ( D i ) | ≥ k i and D i has property P i for i = 1 , 2 when P 1 ∈ H and P 2 ∈ H ∪ E . We also classify the complexity of the same problems when restricted to strongly connected digraphs. We study the complexity of deciding whether a given digraph D has a vertex-partition into two disjoint subdigraphs with given structural properties. Let H and E denote the following two sets of natural properties of digraphs: H = {acyclic, complete, arcless, oriented (no 2-cycle), semicomplete, symmetric, tournament} and E = {strongly connected, connected, minimum out-degree at least 1, minimum in-degree at least 1, minimum semi-degree at least 1, minimum degree at least 1, having an out-branching, having an in-branching}. In this paper, we determine the complexity of deciding, for any fixed pair of positive integers k 1 , k 2 , whether a given digraph has a vertex partition into two digraphs D 1 , D 2 such that | V ( D i ) | ≥ k i and D i has property P i for i = 1 , 2 when P 1 ∈ H and P 2 ∈ H ∪ E . We also classify the complexity of the same problems when restricted to strongly connected digraphs. Polynomial Elsevier Partition Elsevier 2-partition Elsevier Minimum degree Elsevier Feedback vertex set Elsevier Acyclic Elsevier Out-branching Elsevier Oriented Elsevier Splitting digraphs Elsevier NP-complete Elsevier Semicomplete digraph Elsevier Tournament Elsevier Havet, Frédéric oth Enthalten in Elsevier Schweiss, Rüdiger ELSEVIER Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries 2015transfer abstract the journal of the EATCS Amsterdam [u.a.] (DE-627)ELV013125583 volume:636 year:2016 day:11 month:07 pages:85-94 extent:10 https://doi.org/10.1016/j.tcs.2016.05.029 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 636 2016 11 0711 85-94 10 045F 004 |
| allfieldsSound |
10.1016/j.tcs.2016.05.029 doi GBVA2016010000017.pica (DE-627)ELV040055604 (ELSEVIER)S0304-3975(16)30165-7 DE-627 ger DE-627 rakwb eng 004 004 DE-600 620 VZ 690 VZ 50.92 bkl Bang-Jensen, J. verfasserin aut Finding good 2-partitions of digraphs I. Hereditary properties 2016transfer abstract 10 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier We study the complexity of deciding whether a given digraph D has a vertex-partition into two disjoint subdigraphs with given structural properties. Let H and E denote the following two sets of natural properties of digraphs: H = {acyclic, complete, arcless, oriented (no 2-cycle), semicomplete, symmetric, tournament} and E = {strongly connected, connected, minimum out-degree at least 1, minimum in-degree at least 1, minimum semi-degree at least 1, minimum degree at least 1, having an out-branching, having an in-branching}. In this paper, we determine the complexity of deciding, for any fixed pair of positive integers k 1 , k 2 , whether a given digraph has a vertex partition into two digraphs D 1 , D 2 such that | V ( D i ) | ≥ k i and D i has property P i for i = 1 , 2 when P 1 ∈ H and P 2 ∈ H ∪ E . We also classify the complexity of the same problems when restricted to strongly connected digraphs. We study the complexity of deciding whether a given digraph D has a vertex-partition into two disjoint subdigraphs with given structural properties. Let H and E denote the following two sets of natural properties of digraphs: H = {acyclic, complete, arcless, oriented (no 2-cycle), semicomplete, symmetric, tournament} and E = {strongly connected, connected, minimum out-degree at least 1, minimum in-degree at least 1, minimum semi-degree at least 1, minimum degree at least 1, having an out-branching, having an in-branching}. In this paper, we determine the complexity of deciding, for any fixed pair of positive integers k 1 , k 2 , whether a given digraph has a vertex partition into two digraphs D 1 , D 2 such that | V ( D i ) | ≥ k i and D i has property P i for i = 1 , 2 when P 1 ∈ H and P 2 ∈ H ∪ E . We also classify the complexity of the same problems when restricted to strongly connected digraphs. Polynomial Elsevier Partition Elsevier 2-partition Elsevier Minimum degree Elsevier Feedback vertex set Elsevier Acyclic Elsevier Out-branching Elsevier Oriented Elsevier Splitting digraphs Elsevier NP-complete Elsevier Semicomplete digraph Elsevier Tournament Elsevier Havet, Frédéric oth Enthalten in Elsevier Schweiss, Rüdiger ELSEVIER Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries 2015transfer abstract the journal of the EATCS Amsterdam [u.a.] (DE-627)ELV013125583 volume:636 year:2016 day:11 month:07 pages:85-94 extent:10 https://doi.org/10.1016/j.tcs.2016.05.029 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 636 2016 11 0711 85-94 10 045F 004 |
| language |
English |
| source |
Enthalten in Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries Amsterdam [u.a.] volume:636 year:2016 day:11 month:07 pages:85-94 extent:10 |
| sourceStr |
Enthalten in Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries Amsterdam [u.a.] volume:636 year:2016 day:11 month:07 pages:85-94 extent:10 |
| format_phy_str_mv |
Article |
| bklname |
Meerestechnik |
| institution |
findex.gbv.de |
| topic_facet |
Polynomial Partition 2-partition Minimum degree Feedback vertex set Acyclic Out-branching Oriented Splitting digraphs NP-complete Semicomplete digraph Tournament |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |
| authorswithroles_txt_mv |
Bang-Jensen, J. @@aut@@ Havet, Frédéric @@oth@@ |
| publishDateDaySort_date |
2016-01-11T00:00:00Z |
| hierarchy_top_id |
ELV013125583 |
| dewey-sort |
14 |
| id |
ELV040055604 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV040055604</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230625230716.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2016 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.tcs.2016.05.029</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBVA2016010000017.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV040055604</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0304-3975(16)30165-7</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">690</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">50.92</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bang-Jensen, J.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Finding good 2-partitions of digraphs I. Hereditary properties</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">We study the complexity of deciding whether a given digraph D has a vertex-partition into two disjoint subdigraphs with given structural properties. Let H and E denote the following two sets of natural properties of digraphs: H = {acyclic, complete, arcless, oriented (no 2-cycle), semicomplete, symmetric, tournament} and E = {strongly connected, connected, minimum out-degree at least 1, minimum in-degree at least 1, minimum semi-degree at least 1, minimum degree at least 1, having an out-branching, having an in-branching}. In this paper, we determine the complexity of deciding, for any fixed pair of positive integers k 1 , k 2 , whether a given digraph has a vertex partition into two digraphs D 1 , D 2 such that | V ( D i ) | ≥ k i and D i has property P i for i = 1 , 2 when P 1 ∈ H and P 2 ∈ H ∪ E . We also classify the complexity of the same problems when restricted to strongly connected digraphs.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">We study the complexity of deciding whether a given digraph D has a vertex-partition into two disjoint subdigraphs with given structural properties. Let H and E denote the following two sets of natural properties of digraphs: H = {acyclic, complete, arcless, oriented (no 2-cycle), semicomplete, symmetric, tournament} and E = {strongly connected, connected, minimum out-degree at least 1, minimum in-degree at least 1, minimum semi-degree at least 1, minimum degree at least 1, having an out-branching, having an in-branching}. In this paper, we determine the complexity of deciding, for any fixed pair of positive integers k 1 , k 2 , whether a given digraph has a vertex partition into two digraphs D 1 , D 2 such that | V ( D i ) | ≥ k i and D i has property P i for i = 1 , 2 when P 1 ∈ H and P 2 ∈ H ∪ E . We also classify the complexity of the same problems when restricted to strongly connected digraphs.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Polynomial</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Partition</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">2-partition</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Minimum degree</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Feedback vertex set</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Acyclic</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Out-branching</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Oriented</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Splitting digraphs</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">NP-complete</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Semicomplete digraph</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Tournament</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Havet, Frédéric</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="a">Schweiss, Rüdiger ELSEVIER</subfield><subfield code="t">Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries</subfield><subfield code="d">2015transfer abstract</subfield><subfield code="d">the journal of the EATCS</subfield><subfield code="g">Amsterdam [u.a.]</subfield><subfield code="w">(DE-627)ELV013125583</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:636</subfield><subfield code="g">year:2016</subfield><subfield code="g">day:11</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:85-94</subfield><subfield code="g">extent:10</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.tcs.2016.05.029</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">50.92</subfield><subfield code="j">Meerestechnik</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">636</subfield><subfield code="j">2016</subfield><subfield code="b">11</subfield><subfield code="c">0711</subfield><subfield code="h">85-94</subfield><subfield code="g">10</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">004</subfield></datafield></record></collection>
|
| author |
Bang-Jensen, J. |
| spellingShingle |
Bang-Jensen, J. ddc 004 ddc 620 ddc 690 bkl 50.92 Elsevier Polynomial Elsevier Partition Elsevier 2-partition Elsevier Minimum degree Elsevier Feedback vertex set Elsevier Acyclic Elsevier Out-branching Elsevier Oriented Elsevier Splitting digraphs Elsevier NP-complete Elsevier Semicomplete digraph Elsevier Tournament Finding good 2-partitions of digraphs I. Hereditary properties |
| authorStr |
Bang-Jensen, J. |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)ELV013125583 |
| format |
electronic Article |
| dewey-ones |
004 - Data processing & computer science 620 - Engineering & allied operations 690 - Buildings |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
elsevier |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
004 004 DE-600 620 VZ 690 VZ 50.92 bkl Finding good 2-partitions of digraphs I. Hereditary properties Polynomial Elsevier Partition Elsevier 2-partition Elsevier Minimum degree Elsevier Feedback vertex set Elsevier Acyclic Elsevier Out-branching Elsevier Oriented Elsevier Splitting digraphs Elsevier NP-complete Elsevier Semicomplete digraph Elsevier Tournament Elsevier |
| topic |
ddc 004 ddc 620 ddc 690 bkl 50.92 Elsevier Polynomial Elsevier Partition Elsevier 2-partition Elsevier Minimum degree Elsevier Feedback vertex set Elsevier Acyclic Elsevier Out-branching Elsevier Oriented Elsevier Splitting digraphs Elsevier NP-complete Elsevier Semicomplete digraph Elsevier Tournament |
| topic_unstemmed |
ddc 004 ddc 620 ddc 690 bkl 50.92 Elsevier Polynomial Elsevier Partition Elsevier 2-partition Elsevier Minimum degree Elsevier Feedback vertex set Elsevier Acyclic Elsevier Out-branching Elsevier Oriented Elsevier Splitting digraphs Elsevier NP-complete Elsevier Semicomplete digraph Elsevier Tournament |
| topic_browse |
ddc 004 ddc 620 ddc 690 bkl 50.92 Elsevier Polynomial Elsevier Partition Elsevier 2-partition Elsevier Minimum degree Elsevier Feedback vertex set Elsevier Acyclic Elsevier Out-branching Elsevier Oriented Elsevier Splitting digraphs Elsevier NP-complete Elsevier Semicomplete digraph Elsevier Tournament |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| author2_variant |
f h fh |
| hierarchy_parent_title |
Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |
| hierarchy_parent_id |
ELV013125583 |
| dewey-tens |
000 - Computer science, knowledge & systems 620 - Engineering 690 - Building & construction |
| hierarchy_top_title |
Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)ELV013125583 |
| title |
Finding good 2-partitions of digraphs I. Hereditary properties |
| ctrlnum |
(DE-627)ELV040055604 (ELSEVIER)S0304-3975(16)30165-7 |
| title_full |
Finding good 2-partitions of digraphs I. Hereditary properties |
| author_sort |
Bang-Jensen, J. |
| journal |
Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |
| journalStr |
Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 600 - Technology |
| recordtype |
marc |
| publishDateSort |
2016 |
| contenttype_str_mv |
zzz |
| container_start_page |
85 |
| author_browse |
Bang-Jensen, J. |
| container_volume |
636 |
| physical |
10 |
| class |
004 004 DE-600 620 VZ 690 VZ 50.92 bkl |
| format_se |
Elektronische Aufsätze |
| author-letter |
Bang-Jensen, J. |
| doi_str_mv |
10.1016/j.tcs.2016.05.029 |
| dewey-full |
004 620 690 |
| title_sort |
finding good 2-partitions of digraphs i. hereditary properties |
| title_auth |
Finding good 2-partitions of digraphs I. Hereditary properties |
| abstract |
We study the complexity of deciding whether a given digraph D has a vertex-partition into two disjoint subdigraphs with given structural properties. Let H and E denote the following two sets of natural properties of digraphs: H = {acyclic, complete, arcless, oriented (no 2-cycle), semicomplete, symmetric, tournament} and E = {strongly connected, connected, minimum out-degree at least 1, minimum in-degree at least 1, minimum semi-degree at least 1, minimum degree at least 1, having an out-branching, having an in-branching}. In this paper, we determine the complexity of deciding, for any fixed pair of positive integers k 1 , k 2 , whether a given digraph has a vertex partition into two digraphs D 1 , D 2 such that | V ( D i ) | ≥ k i and D i has property P i for i = 1 , 2 when P 1 ∈ H and P 2 ∈ H ∪ E . We also classify the complexity of the same problems when restricted to strongly connected digraphs. |
| abstractGer |
We study the complexity of deciding whether a given digraph D has a vertex-partition into two disjoint subdigraphs with given structural properties. Let H and E denote the following two sets of natural properties of digraphs: H = {acyclic, complete, arcless, oriented (no 2-cycle), semicomplete, symmetric, tournament} and E = {strongly connected, connected, minimum out-degree at least 1, minimum in-degree at least 1, minimum semi-degree at least 1, minimum degree at least 1, having an out-branching, having an in-branching}. In this paper, we determine the complexity of deciding, for any fixed pair of positive integers k 1 , k 2 , whether a given digraph has a vertex partition into two digraphs D 1 , D 2 such that | V ( D i ) | ≥ k i and D i has property P i for i = 1 , 2 when P 1 ∈ H and P 2 ∈ H ∪ E . We also classify the complexity of the same problems when restricted to strongly connected digraphs. |
| abstract_unstemmed |
We study the complexity of deciding whether a given digraph D has a vertex-partition into two disjoint subdigraphs with given structural properties. Let H and E denote the following two sets of natural properties of digraphs: H = {acyclic, complete, arcless, oriented (no 2-cycle), semicomplete, symmetric, tournament} and E = {strongly connected, connected, minimum out-degree at least 1, minimum in-degree at least 1, minimum semi-degree at least 1, minimum degree at least 1, having an out-branching, having an in-branching}. In this paper, we determine the complexity of deciding, for any fixed pair of positive integers k 1 , k 2 , whether a given digraph has a vertex partition into two digraphs D 1 , D 2 such that | V ( D i ) | ≥ k i and D i has property P i for i = 1 , 2 when P 1 ∈ H and P 2 ∈ H ∪ E . We also classify the complexity of the same problems when restricted to strongly connected digraphs. |
| collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 |
| title_short |
Finding good 2-partitions of digraphs I. Hereditary properties |
| url |
https://doi.org/10.1016/j.tcs.2016.05.029 |
| remote_bool |
true |
| author2 |
Havet, Frédéric |
| author2Str |
Havet, Frédéric |
| ppnlink |
ELV013125583 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth |
| doi_str |
10.1016/j.tcs.2016.05.029 |
| up_date |
2024-07-06T16:32:36.955Z |
| _version_ |
1803848051022888960 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV040055604</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230625230716.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2016 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.tcs.2016.05.029</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBVA2016010000017.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV040055604</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0304-3975(16)30165-7</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">690</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">50.92</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bang-Jensen, J.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Finding good 2-partitions of digraphs I. Hereditary properties</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">We study the complexity of deciding whether a given digraph D has a vertex-partition into two disjoint subdigraphs with given structural properties. Let H and E denote the following two sets of natural properties of digraphs: H = {acyclic, complete, arcless, oriented (no 2-cycle), semicomplete, symmetric, tournament} and E = {strongly connected, connected, minimum out-degree at least 1, minimum in-degree at least 1, minimum semi-degree at least 1, minimum degree at least 1, having an out-branching, having an in-branching}. In this paper, we determine the complexity of deciding, for any fixed pair of positive integers k 1 , k 2 , whether a given digraph has a vertex partition into two digraphs D 1 , D 2 such that | V ( D i ) | ≥ k i and D i has property P i for i = 1 , 2 when P 1 ∈ H and P 2 ∈ H ∪ E . We also classify the complexity of the same problems when restricted to strongly connected digraphs.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">We study the complexity of deciding whether a given digraph D has a vertex-partition into two disjoint subdigraphs with given structural properties. Let H and E denote the following two sets of natural properties of digraphs: H = {acyclic, complete, arcless, oriented (no 2-cycle), semicomplete, symmetric, tournament} and E = {strongly connected, connected, minimum out-degree at least 1, minimum in-degree at least 1, minimum semi-degree at least 1, minimum degree at least 1, having an out-branching, having an in-branching}. In this paper, we determine the complexity of deciding, for any fixed pair of positive integers k 1 , k 2 , whether a given digraph has a vertex partition into two digraphs D 1 , D 2 such that | V ( D i ) | ≥ k i and D i has property P i for i = 1 , 2 when P 1 ∈ H and P 2 ∈ H ∪ E . We also classify the complexity of the same problems when restricted to strongly connected digraphs.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Polynomial</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Partition</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">2-partition</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Minimum degree</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Feedback vertex set</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Acyclic</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Out-branching</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Oriented</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Splitting digraphs</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">NP-complete</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Semicomplete digraph</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Tournament</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Havet, Frédéric</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="a">Schweiss, Rüdiger ELSEVIER</subfield><subfield code="t">Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries</subfield><subfield code="d">2015transfer abstract</subfield><subfield code="d">the journal of the EATCS</subfield><subfield code="g">Amsterdam [u.a.]</subfield><subfield code="w">(DE-627)ELV013125583</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:636</subfield><subfield code="g">year:2016</subfield><subfield code="g">day:11</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:85-94</subfield><subfield code="g">extent:10</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.tcs.2016.05.029</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">50.92</subfield><subfield code="j">Meerestechnik</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">636</subfield><subfield code="j">2016</subfield><subfield code="b">11</subfield><subfield code="c">0711</subfield><subfield code="h">85-94</subfield><subfield code="g">10</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">004</subfield></datafield></record></collection>
|
| score |
7.399292 |