The complexity of the zero-sum 3-flows
A zero-sum k-flow for a graph G is a vector in the null-space of the 0,10,1-incidence matrix of G such that its entries belong to ... Akbari et al. (2009) conjectured that if G is a graph with a zero-sum flow, then G admits a zero-sum 6-flow. (2,3)-semiregular graphs are an important family in study...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Ali Dehghan [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2015 |
|---|
| Schlagwörter: |
|---|
| Systematik: |
|
|---|
| Übergeordnetes Werk: |
Enthalten in: Information processing letters - Amsterdam [u.a.] : Elsevier, 1971, 115(2015), 2, Seite 316-320 |
|---|---|
| Übergeordnetes Werk: |
volume:115 ; year:2015 ; number:2 ; pages:316-320 |
| Links: |
|---|
| DOI / URN: |
10.1016/j.ipl.2014.10.004 |
|---|
| Katalog-ID: |
OLC1963669320 |
|---|
| LEADER | 01000caa a2200265 4500 | ||
|---|---|---|---|
| 001 | OLC1963669320 | ||
| 003 | DE-627 | ||
| 005 | 20220216172633.0 | ||
| 007 | tu | ||
| 008 | 160206s2015 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1016/j.ipl.2014.10.004 |2 doi | |
| 028 | 5 | 2 | |a PQ20160617 |
| 035 | |a (DE-627)OLC1963669320 | ||
| 035 | |a (DE-599)GBVOLC1963669320 | ||
| 035 | |a (PRQ)c2359-446c21351795cfc589d2664c44b2ee5469f0c99c1eaad6a59dc619dc13f9281e0 | ||
| 035 | |a (KEY)0019592820150000115000200316complexityofthezerosum3flows | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q DNB |
| 084 | |a SA 5400 |q AVZ |2 rvk | ||
| 084 | |a 54.00 |2 bkl | ||
| 100 | 0 | |a Ali Dehghan |e verfasserin |4 aut | |
| 245 | 1 | 4 | |a The complexity of the zero-sum 3-flows |
| 264 | 1 | |c 2015 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 520 | |a A zero-sum k-flow for a graph G is a vector in the null-space of the 0,10,1-incidence matrix of G such that its entries belong to ... Akbari et al. (2009) conjectured that if G is a graph with a zero-sum flow, then G admits a zero-sum 6-flow. (2,3)-semiregular graphs are an important family in studying zero-sum flows. Akbari et al. (2009) proved that if Zero-Sum Conjecture is true for any (2,3)-semiregular graph, then it is true for any graph. In this paper, we show that there is a polynomial time algorithm to determine whether a given (2,3)-graph G has a zero-sum 3-flow. In fact, we show that, there is a polynomial time algorithm to determine whether a given (2,4)-graph G with n vertices has a zero-sum 3-flow, where the number of vertices of degree four is ... Furthermore, we show that it is NP-complete to determine whether a given (3,4)-semiregular graph has a zero-sum 3-flow. (ProQuest: ... denotes formulae/symbols omitted.) | ||
| 650 | 4 | |a Graph theory | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Studies | |
| 650 | 4 | |a Complexity theory | |
| 650 | 4 | |a Polynomials | |
| 700 | 0 | |a Mohammad-Reza Sadeghi |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |t Information processing letters |d Amsterdam [u.a.] : Elsevier, 1971 |g 115(2015), 2, Seite 316-320 |w (DE-627)129288853 |w (DE-600)120125-6 |w (DE-576)014470411 |x 0020-0190 |7 nnns |
| 773 | 1 | 8 | |g volume:115 |g year:2015 |g number:2 |g pages:316-320 |
| 856 | 4 | 1 | |u http://dx.doi.org/10.1016/j.ipl.2014.10.004 |3 Volltext |
| 856 | 4 | 2 | |u http://search.proquest.com/docview/1628654245 |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-TEC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OLC-BUB | ||
| 912 | |a SSG-OPC-BBI | ||
| 912 | |a GBV_ILN_21 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_4126 | ||
| 912 | |a GBV_ILN_4318 | ||
| 936 | r | v | |a SA 5400 |
| 936 | b | k | |a 54.00 |q AVZ |
| 951 | |a AR | ||
| 952 | |d 115 |j 2015 |e 2 |h 316-320 | ||
| author_variant |
a d ad |
|---|---|
| matchkey_str |
article:00200190:2015----::hcmlxtotee |
| hierarchy_sort_str |
2015 |
| bklnumber |
54.00 |
| publishDate |
2015 |
| allfields |
10.1016/j.ipl.2014.10.004 doi PQ20160617 (DE-627)OLC1963669320 (DE-599)GBVOLC1963669320 (PRQ)c2359-446c21351795cfc589d2664c44b2ee5469f0c99c1eaad6a59dc619dc13f9281e0 (KEY)0019592820150000115000200316complexityofthezerosum3flows DE-627 ger DE-627 rakwb eng 004 DNB SA 5400 AVZ rvk 54.00 bkl Ali Dehghan verfasserin aut The complexity of the zero-sum 3-flows 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier A zero-sum k-flow for a graph G is a vector in the null-space of the 0,10,1-incidence matrix of G such that its entries belong to ... Akbari et al. (2009) conjectured that if G is a graph with a zero-sum flow, then G admits a zero-sum 6-flow. (2,3)-semiregular graphs are an important family in studying zero-sum flows. Akbari et al. (2009) proved that if Zero-Sum Conjecture is true for any (2,3)-semiregular graph, then it is true for any graph. In this paper, we show that there is a polynomial time algorithm to determine whether a given (2,3)-graph G has a zero-sum 3-flow. In fact, we show that, there is a polynomial time algorithm to determine whether a given (2,4)-graph G with n vertices has a zero-sum 3-flow, where the number of vertices of degree four is ... Furthermore, we show that it is NP-complete to determine whether a given (3,4)-semiregular graph has a zero-sum 3-flow. (ProQuest: ... denotes formulae/symbols omitted.) Graph theory Algorithms Studies Complexity theory Polynomials Mohammad-Reza Sadeghi oth Enthalten in Information processing letters Amsterdam [u.a.] : Elsevier, 1971 115(2015), 2, Seite 316-320 (DE-627)129288853 (DE-600)120125-6 (DE-576)014470411 0020-0190 nnns volume:115 year:2015 number:2 pages:316-320 http://dx.doi.org/10.1016/j.ipl.2014.10.004 Volltext http://search.proquest.com/docview/1628654245 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI GBV_ILN_21 GBV_ILN_70 GBV_ILN_4126 GBV_ILN_4318 SA 5400 54.00 AVZ AR 115 2015 2 316-320 |
| spelling |
10.1016/j.ipl.2014.10.004 doi PQ20160617 (DE-627)OLC1963669320 (DE-599)GBVOLC1963669320 (PRQ)c2359-446c21351795cfc589d2664c44b2ee5469f0c99c1eaad6a59dc619dc13f9281e0 (KEY)0019592820150000115000200316complexityofthezerosum3flows DE-627 ger DE-627 rakwb eng 004 DNB SA 5400 AVZ rvk 54.00 bkl Ali Dehghan verfasserin aut The complexity of the zero-sum 3-flows 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier A zero-sum k-flow for a graph G is a vector in the null-space of the 0,10,1-incidence matrix of G such that its entries belong to ... Akbari et al. (2009) conjectured that if G is a graph with a zero-sum flow, then G admits a zero-sum 6-flow. (2,3)-semiregular graphs are an important family in studying zero-sum flows. Akbari et al. (2009) proved that if Zero-Sum Conjecture is true for any (2,3)-semiregular graph, then it is true for any graph. In this paper, we show that there is a polynomial time algorithm to determine whether a given (2,3)-graph G has a zero-sum 3-flow. In fact, we show that, there is a polynomial time algorithm to determine whether a given (2,4)-graph G with n vertices has a zero-sum 3-flow, where the number of vertices of degree four is ... Furthermore, we show that it is NP-complete to determine whether a given (3,4)-semiregular graph has a zero-sum 3-flow. (ProQuest: ... denotes formulae/symbols omitted.) Graph theory Algorithms Studies Complexity theory Polynomials Mohammad-Reza Sadeghi oth Enthalten in Information processing letters Amsterdam [u.a.] : Elsevier, 1971 115(2015), 2, Seite 316-320 (DE-627)129288853 (DE-600)120125-6 (DE-576)014470411 0020-0190 nnns volume:115 year:2015 number:2 pages:316-320 http://dx.doi.org/10.1016/j.ipl.2014.10.004 Volltext http://search.proquest.com/docview/1628654245 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI GBV_ILN_21 GBV_ILN_70 GBV_ILN_4126 GBV_ILN_4318 SA 5400 54.00 AVZ AR 115 2015 2 316-320 |
| allfields_unstemmed |
10.1016/j.ipl.2014.10.004 doi PQ20160617 (DE-627)OLC1963669320 (DE-599)GBVOLC1963669320 (PRQ)c2359-446c21351795cfc589d2664c44b2ee5469f0c99c1eaad6a59dc619dc13f9281e0 (KEY)0019592820150000115000200316complexityofthezerosum3flows DE-627 ger DE-627 rakwb eng 004 DNB SA 5400 AVZ rvk 54.00 bkl Ali Dehghan verfasserin aut The complexity of the zero-sum 3-flows 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier A zero-sum k-flow for a graph G is a vector in the null-space of the 0,10,1-incidence matrix of G such that its entries belong to ... Akbari et al. (2009) conjectured that if G is a graph with a zero-sum flow, then G admits a zero-sum 6-flow. (2,3)-semiregular graphs are an important family in studying zero-sum flows. Akbari et al. (2009) proved that if Zero-Sum Conjecture is true for any (2,3)-semiregular graph, then it is true for any graph. In this paper, we show that there is a polynomial time algorithm to determine whether a given (2,3)-graph G has a zero-sum 3-flow. In fact, we show that, there is a polynomial time algorithm to determine whether a given (2,4)-graph G with n vertices has a zero-sum 3-flow, where the number of vertices of degree four is ... Furthermore, we show that it is NP-complete to determine whether a given (3,4)-semiregular graph has a zero-sum 3-flow. (ProQuest: ... denotes formulae/symbols omitted.) Graph theory Algorithms Studies Complexity theory Polynomials Mohammad-Reza Sadeghi oth Enthalten in Information processing letters Amsterdam [u.a.] : Elsevier, 1971 115(2015), 2, Seite 316-320 (DE-627)129288853 (DE-600)120125-6 (DE-576)014470411 0020-0190 nnns volume:115 year:2015 number:2 pages:316-320 http://dx.doi.org/10.1016/j.ipl.2014.10.004 Volltext http://search.proquest.com/docview/1628654245 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI GBV_ILN_21 GBV_ILN_70 GBV_ILN_4126 GBV_ILN_4318 SA 5400 54.00 AVZ AR 115 2015 2 316-320 |
| allfieldsGer |
10.1016/j.ipl.2014.10.004 doi PQ20160617 (DE-627)OLC1963669320 (DE-599)GBVOLC1963669320 (PRQ)c2359-446c21351795cfc589d2664c44b2ee5469f0c99c1eaad6a59dc619dc13f9281e0 (KEY)0019592820150000115000200316complexityofthezerosum3flows DE-627 ger DE-627 rakwb eng 004 DNB SA 5400 AVZ rvk 54.00 bkl Ali Dehghan verfasserin aut The complexity of the zero-sum 3-flows 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier A zero-sum k-flow for a graph G is a vector in the null-space of the 0,10,1-incidence matrix of G such that its entries belong to ... Akbari et al. (2009) conjectured that if G is a graph with a zero-sum flow, then G admits a zero-sum 6-flow. (2,3)-semiregular graphs are an important family in studying zero-sum flows. Akbari et al. (2009) proved that if Zero-Sum Conjecture is true for any (2,3)-semiregular graph, then it is true for any graph. In this paper, we show that there is a polynomial time algorithm to determine whether a given (2,3)-graph G has a zero-sum 3-flow. In fact, we show that, there is a polynomial time algorithm to determine whether a given (2,4)-graph G with n vertices has a zero-sum 3-flow, where the number of vertices of degree four is ... Furthermore, we show that it is NP-complete to determine whether a given (3,4)-semiregular graph has a zero-sum 3-flow. (ProQuest: ... denotes formulae/symbols omitted.) Graph theory Algorithms Studies Complexity theory Polynomials Mohammad-Reza Sadeghi oth Enthalten in Information processing letters Amsterdam [u.a.] : Elsevier, 1971 115(2015), 2, Seite 316-320 (DE-627)129288853 (DE-600)120125-6 (DE-576)014470411 0020-0190 nnns volume:115 year:2015 number:2 pages:316-320 http://dx.doi.org/10.1016/j.ipl.2014.10.004 Volltext http://search.proquest.com/docview/1628654245 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI GBV_ILN_21 GBV_ILN_70 GBV_ILN_4126 GBV_ILN_4318 SA 5400 54.00 AVZ AR 115 2015 2 316-320 |
| allfieldsSound |
10.1016/j.ipl.2014.10.004 doi PQ20160617 (DE-627)OLC1963669320 (DE-599)GBVOLC1963669320 (PRQ)c2359-446c21351795cfc589d2664c44b2ee5469f0c99c1eaad6a59dc619dc13f9281e0 (KEY)0019592820150000115000200316complexityofthezerosum3flows DE-627 ger DE-627 rakwb eng 004 DNB SA 5400 AVZ rvk 54.00 bkl Ali Dehghan verfasserin aut The complexity of the zero-sum 3-flows 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier A zero-sum k-flow for a graph G is a vector in the null-space of the 0,10,1-incidence matrix of G such that its entries belong to ... Akbari et al. (2009) conjectured that if G is a graph with a zero-sum flow, then G admits a zero-sum 6-flow. (2,3)-semiregular graphs are an important family in studying zero-sum flows. Akbari et al. (2009) proved that if Zero-Sum Conjecture is true for any (2,3)-semiregular graph, then it is true for any graph. In this paper, we show that there is a polynomial time algorithm to determine whether a given (2,3)-graph G has a zero-sum 3-flow. In fact, we show that, there is a polynomial time algorithm to determine whether a given (2,4)-graph G with n vertices has a zero-sum 3-flow, where the number of vertices of degree four is ... Furthermore, we show that it is NP-complete to determine whether a given (3,4)-semiregular graph has a zero-sum 3-flow. (ProQuest: ... denotes formulae/symbols omitted.) Graph theory Algorithms Studies Complexity theory Polynomials Mohammad-Reza Sadeghi oth Enthalten in Information processing letters Amsterdam [u.a.] : Elsevier, 1971 115(2015), 2, Seite 316-320 (DE-627)129288853 (DE-600)120125-6 (DE-576)014470411 0020-0190 nnns volume:115 year:2015 number:2 pages:316-320 http://dx.doi.org/10.1016/j.ipl.2014.10.004 Volltext http://search.proquest.com/docview/1628654245 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI GBV_ILN_21 GBV_ILN_70 GBV_ILN_4126 GBV_ILN_4318 SA 5400 54.00 AVZ AR 115 2015 2 316-320 |
| language |
English |
| source |
Enthalten in Information processing letters 115(2015), 2, Seite 316-320 volume:115 year:2015 number:2 pages:316-320 |
| sourceStr |
Enthalten in Information processing letters 115(2015), 2, Seite 316-320 volume:115 year:2015 number:2 pages:316-320 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Graph theory Algorithms Studies Complexity theory Polynomials |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Information processing letters |
| authorswithroles_txt_mv |
Ali Dehghan @@aut@@ Mohammad-Reza Sadeghi @@oth@@ |
| publishDateDaySort_date |
2015-01-01T00:00:00Z |
| hierarchy_top_id |
129288853 |
| dewey-sort |
14 |
| id |
OLC1963669320 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1963669320</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220216172633.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160206s2015 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.ipl.2014.10.004</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160617</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1963669320</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1963669320</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)c2359-446c21351795cfc589d2664c44b2ee5469f0c99c1eaad6a59dc619dc13f9281e0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0019592820150000115000200316complexityofthezerosum3flows</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="4"><subfield code="a">004</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SA 5400</subfield><subfield code="q">AVZ</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Ali Dehghan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="4"><subfield code="a">The complexity of the zero-sum 3-flows</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">A zero-sum k-flow for a graph G is a vector in the null-space of the 0,10,1-incidence matrix of G such that its entries belong to ... Akbari et al. (2009) conjectured that if G is a graph with a zero-sum flow, then G admits a zero-sum 6-flow. (2,3)-semiregular graphs are an important family in studying zero-sum flows. Akbari et al. (2009) proved that if Zero-Sum Conjecture is true for any (2,3)-semiregular graph, then it is true for any graph. In this paper, we show that there is a polynomial time algorithm to determine whether a given (2,3)-graph G has a zero-sum 3-flow. In fact, we show that, there is a polynomial time algorithm to determine whether a given (2,4)-graph G with n vertices has a zero-sum 3-flow, where the number of vertices of degree four is ... Furthermore, we show that it is NP-complete to determine whether a given (3,4)-semiregular graph has a zero-sum 3-flow. (ProQuest: ... denotes formulae/symbols omitted.)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Studies</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexity theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Polynomials</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Mohammad-Reza Sadeghi</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Information processing letters</subfield><subfield code="d">Amsterdam [u.a.] : Elsevier, 1971</subfield><subfield code="g">115(2015), 2, Seite 316-320</subfield><subfield code="w">(DE-627)129288853</subfield><subfield code="w">(DE-600)120125-6</subfield><subfield code="w">(DE-576)014470411</subfield><subfield code="x">0020-0190</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:115</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:2</subfield><subfield code="g">pages:316-320</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1016/j.ipl.2014.10.004</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://search.proquest.com/docview/1628654245</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-BUB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-BBI</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SA 5400</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.00</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">115</subfield><subfield code="j">2015</subfield><subfield code="e">2</subfield><subfield code="h">316-320</subfield></datafield></record></collection>
|
| author |
Ali Dehghan |
| spellingShingle |
Ali Dehghan ddc 004 rvk SA 5400 bkl 54.00 misc Graph theory misc Algorithms misc Studies misc Complexity theory misc Polynomials The complexity of the zero-sum 3-flows |
| authorStr |
Ali Dehghan |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)129288853 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0020-0190 |
| topic_title |
004 DNB SA 5400 AVZ rvk 54.00 bkl The complexity of the zero-sum 3-flows Graph theory Algorithms Studies Complexity theory Polynomials |
| topic |
ddc 004 rvk SA 5400 bkl 54.00 misc Graph theory misc Algorithms misc Studies misc Complexity theory misc Polynomials |
| topic_unstemmed |
ddc 004 rvk SA 5400 bkl 54.00 misc Graph theory misc Algorithms misc Studies misc Complexity theory misc Polynomials |
| topic_browse |
ddc 004 rvk SA 5400 bkl 54.00 misc Graph theory misc Algorithms misc Studies misc Complexity theory misc Polynomials |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| author2_variant |
m r s mrs |
| hierarchy_parent_title |
Information processing letters |
| hierarchy_parent_id |
129288853 |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Information processing letters |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)129288853 (DE-600)120125-6 (DE-576)014470411 |
| title |
The complexity of the zero-sum 3-flows |
| ctrlnum |
(DE-627)OLC1963669320 (DE-599)GBVOLC1963669320 (PRQ)c2359-446c21351795cfc589d2664c44b2ee5469f0c99c1eaad6a59dc619dc13f9281e0 (KEY)0019592820150000115000200316complexityofthezerosum3flows |
| title_full |
The complexity of the zero-sum 3-flows |
| author_sort |
Ali Dehghan |
| journal |
Information processing letters |
| journalStr |
Information processing letters |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2015 |
| contenttype_str_mv |
txt |
| container_start_page |
316 |
| author_browse |
Ali Dehghan |
| container_volume |
115 |
| class |
004 DNB SA 5400 AVZ rvk 54.00 bkl |
| format_se |
Aufsätze |
| author-letter |
Ali Dehghan |
| doi_str_mv |
10.1016/j.ipl.2014.10.004 |
| dewey-full |
004 |
| title_sort |
complexity of the zero-sum 3-flows |
| title_auth |
The complexity of the zero-sum 3-flows |
| abstract |
A zero-sum k-flow for a graph G is a vector in the null-space of the 0,10,1-incidence matrix of G such that its entries belong to ... Akbari et al. (2009) conjectured that if G is a graph with a zero-sum flow, then G admits a zero-sum 6-flow. (2,3)-semiregular graphs are an important family in studying zero-sum flows. Akbari et al. (2009) proved that if Zero-Sum Conjecture is true for any (2,3)-semiregular graph, then it is true for any graph. In this paper, we show that there is a polynomial time algorithm to determine whether a given (2,3)-graph G has a zero-sum 3-flow. In fact, we show that, there is a polynomial time algorithm to determine whether a given (2,4)-graph G with n vertices has a zero-sum 3-flow, where the number of vertices of degree four is ... Furthermore, we show that it is NP-complete to determine whether a given (3,4)-semiregular graph has a zero-sum 3-flow. (ProQuest: ... denotes formulae/symbols omitted.) |
| abstractGer |
A zero-sum k-flow for a graph G is a vector in the null-space of the 0,10,1-incidence matrix of G such that its entries belong to ... Akbari et al. (2009) conjectured that if G is a graph with a zero-sum flow, then G admits a zero-sum 6-flow. (2,3)-semiregular graphs are an important family in studying zero-sum flows. Akbari et al. (2009) proved that if Zero-Sum Conjecture is true for any (2,3)-semiregular graph, then it is true for any graph. In this paper, we show that there is a polynomial time algorithm to determine whether a given (2,3)-graph G has a zero-sum 3-flow. In fact, we show that, there is a polynomial time algorithm to determine whether a given (2,4)-graph G with n vertices has a zero-sum 3-flow, where the number of vertices of degree four is ... Furthermore, we show that it is NP-complete to determine whether a given (3,4)-semiregular graph has a zero-sum 3-flow. (ProQuest: ... denotes formulae/symbols omitted.) |
| abstract_unstemmed |
A zero-sum k-flow for a graph G is a vector in the null-space of the 0,10,1-incidence matrix of G such that its entries belong to ... Akbari et al. (2009) conjectured that if G is a graph with a zero-sum flow, then G admits a zero-sum 6-flow. (2,3)-semiregular graphs are an important family in studying zero-sum flows. Akbari et al. (2009) proved that if Zero-Sum Conjecture is true for any (2,3)-semiregular graph, then it is true for any graph. In this paper, we show that there is a polynomial time algorithm to determine whether a given (2,3)-graph G has a zero-sum 3-flow. In fact, we show that, there is a polynomial time algorithm to determine whether a given (2,4)-graph G with n vertices has a zero-sum 3-flow, where the number of vertices of degree four is ... Furthermore, we show that it is NP-complete to determine whether a given (3,4)-semiregular graph has a zero-sum 3-flow. (ProQuest: ... denotes formulae/symbols omitted.) |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI GBV_ILN_21 GBV_ILN_70 GBV_ILN_4126 GBV_ILN_4318 |
| container_issue |
2 |
| title_short |
The complexity of the zero-sum 3-flows |
| url |
http://dx.doi.org/10.1016/j.ipl.2014.10.004 http://search.proquest.com/docview/1628654245 |
| remote_bool |
false |
| author2 |
Mohammad-Reza Sadeghi |
| author2Str |
Mohammad-Reza Sadeghi |
| ppnlink |
129288853 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth |
| doi_str |
10.1016/j.ipl.2014.10.004 |
| up_date |
2024-07-04T06:14:43.057Z |
| _version_ |
1803627982286225408 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1963669320</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220216172633.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160206s2015 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.ipl.2014.10.004</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160617</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1963669320</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1963669320</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)c2359-446c21351795cfc589d2664c44b2ee5469f0c99c1eaad6a59dc619dc13f9281e0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0019592820150000115000200316complexityofthezerosum3flows</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="4"><subfield code="a">004</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SA 5400</subfield><subfield code="q">AVZ</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Ali Dehghan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="4"><subfield code="a">The complexity of the zero-sum 3-flows</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">A zero-sum k-flow for a graph G is a vector in the null-space of the 0,10,1-incidence matrix of G such that its entries belong to ... Akbari et al. (2009) conjectured that if G is a graph with a zero-sum flow, then G admits a zero-sum 6-flow. (2,3)-semiregular graphs are an important family in studying zero-sum flows. Akbari et al. (2009) proved that if Zero-Sum Conjecture is true for any (2,3)-semiregular graph, then it is true for any graph. In this paper, we show that there is a polynomial time algorithm to determine whether a given (2,3)-graph G has a zero-sum 3-flow. In fact, we show that, there is a polynomial time algorithm to determine whether a given (2,4)-graph G with n vertices has a zero-sum 3-flow, where the number of vertices of degree four is ... Furthermore, we show that it is NP-complete to determine whether a given (3,4)-semiregular graph has a zero-sum 3-flow. (ProQuest: ... denotes formulae/symbols omitted.)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Studies</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexity theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Polynomials</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Mohammad-Reza Sadeghi</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Information processing letters</subfield><subfield code="d">Amsterdam [u.a.] : Elsevier, 1971</subfield><subfield code="g">115(2015), 2, Seite 316-320</subfield><subfield code="w">(DE-627)129288853</subfield><subfield code="w">(DE-600)120125-6</subfield><subfield code="w">(DE-576)014470411</subfield><subfield code="x">0020-0190</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:115</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:2</subfield><subfield code="g">pages:316-320</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1016/j.ipl.2014.10.004</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://search.proquest.com/docview/1628654245</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-BUB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-BBI</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SA 5400</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.00</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">115</subfield><subfield code="j">2015</subfield><subfield code="e">2</subfield><subfield code="h">316-320</subfield></datafield></record></collection>
|
| score |
7.398242 |