Finding disjoint dense clubs in a social network
In a social network, the trust among its members usually cannot be carried over many hops. So it is important to find disjoint clusters with a small diameter and with a decent size, formally called dense clubs. We focus on handling this NP-complete problem in this paper. First, from the parameterize...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Zou, Peng [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2018transfer abstract |
|---|
| Schlagwörter: |
|---|
| Umfang: |
9 |
|---|
| Ü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:734 ; year:2018 ; day:22 ; month:07 ; pages:15-23 ; extent:9 |
| Links: |
|---|
| DOI / URN: |
10.1016/j.tcs.2017.10.018 |
|---|
| Katalog-ID: |
ELV043321771 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | ELV043321771 | ||
| 003 | DE-627 | ||
| 005 | 20230626003509.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 180726s2018 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1016/j.tcs.2017.10.018 |2 doi | |
| 028 | 5 | 2 | |a GBV00000000000690.pica |
| 035 | |a (DE-627)ELV043321771 | ||
| 035 | |a (ELSEVIER)S0304-3975(17)30746-6 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 620 |q VZ |
| 082 | 0 | 4 | |a 690 |q VZ |
| 084 | |a 50.92 |2 bkl | ||
| 100 | 1 | |a Zou, Peng |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Finding disjoint dense clubs in a social network |
| 264 | 1 | |c 2018transfer abstract | |
| 300 | |a 9 | ||
| 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 In a social network, the trust among its members usually cannot be carried over many hops. So it is important to find disjoint clusters with a small diameter and with a decent size, formally called dense clubs. We focus on handling this NP-complete problem in this paper. First, from the parameterized computational complexity point of view, we show that this problem does not admit a polynomial kernel (implying that it is unlikely to apply some reduction rules to obtain a practically small problem size). Then, we focus on the dual version of the problem, i.e., deleting d vertices to obtain some isolated dense clubs. We show that this dual problem admits a simple FPT algorithm using a bounded search tree method (the running time is still too high for practical datasets). Finally, we combine a simple reduction rule together with two branching rules to obtain a practical solution (verified by extensive testing on practical datasets). | ||
| 520 | |a In a social network, the trust among its members usually cannot be carried over many hops. So it is important to find disjoint clusters with a small diameter and with a decent size, formally called dense clubs. We focus on handling this NP-complete problem in this paper. First, from the parameterized computational complexity point of view, we show that this problem does not admit a polynomial kernel (implying that it is unlikely to apply some reduction rules to obtain a practically small problem size). Then, we focus on the dual version of the problem, i.e., deleting d vertices to obtain some isolated dense clubs. We show that this dual problem admits a simple FPT algorithm using a bounded search tree method (the running time is still too high for practical datasets). Finally, we combine a simple reduction rule together with two branching rules to obtain a practical solution (verified by extensive testing on practical datasets). | ||
| 650 | 7 | |a FPT algorithms |2 Elsevier | |
| 650 | 7 | |a Clusters |2 Elsevier | |
| 650 | 7 | |a Social networks |2 Elsevier | |
| 650 | 7 | |a Clubs |2 Elsevier | |
| 650 | 7 | |a Kernelization |2 Elsevier | |
| 700 | 1 | |a Li, Hui |4 oth | |
| 700 | 1 | |a Wang, Wencheng |4 oth | |
| 700 | 1 | |a Xin, Chunlin |4 oth | |
| 700 | 1 | |a Zhu, Binhai |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:734 |g year:2018 |g day:22 |g month:07 |g pages:15-23 |g extent:9 |
| 856 | 4 | 0 | |u https://doi.org/10.1016/j.tcs.2017.10.018 |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 734 |j 2018 |b 22 |c 0722 |h 15-23 |g 9 | ||
| author_variant |
p z pz |
|---|---|
| matchkey_str |
zoupenglihuiwangwenchengxinchunlinzhubin:2018----:idndsondnelbiao |
| hierarchy_sort_str |
2018transfer abstract |
| bklnumber |
50.92 |
| publishDate |
2018 |
| allfields |
10.1016/j.tcs.2017.10.018 doi GBV00000000000690.pica (DE-627)ELV043321771 (ELSEVIER)S0304-3975(17)30746-6 DE-627 ger DE-627 rakwb eng 620 VZ 690 VZ 50.92 bkl Zou, Peng verfasserin aut Finding disjoint dense clubs in a social network 2018transfer abstract 9 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier In a social network, the trust among its members usually cannot be carried over many hops. So it is important to find disjoint clusters with a small diameter and with a decent size, formally called dense clubs. We focus on handling this NP-complete problem in this paper. First, from the parameterized computational complexity point of view, we show that this problem does not admit a polynomial kernel (implying that it is unlikely to apply some reduction rules to obtain a practically small problem size). Then, we focus on the dual version of the problem, i.e., deleting d vertices to obtain some isolated dense clubs. We show that this dual problem admits a simple FPT algorithm using a bounded search tree method (the running time is still too high for practical datasets). Finally, we combine a simple reduction rule together with two branching rules to obtain a practical solution (verified by extensive testing on practical datasets). In a social network, the trust among its members usually cannot be carried over many hops. So it is important to find disjoint clusters with a small diameter and with a decent size, formally called dense clubs. We focus on handling this NP-complete problem in this paper. First, from the parameterized computational complexity point of view, we show that this problem does not admit a polynomial kernel (implying that it is unlikely to apply some reduction rules to obtain a practically small problem size). Then, we focus on the dual version of the problem, i.e., deleting d vertices to obtain some isolated dense clubs. We show that this dual problem admits a simple FPT algorithm using a bounded search tree method (the running time is still too high for practical datasets). Finally, we combine a simple reduction rule together with two branching rules to obtain a practical solution (verified by extensive testing on practical datasets). FPT algorithms Elsevier Clusters Elsevier Social networks Elsevier Clubs Elsevier Kernelization Elsevier Li, Hui oth Wang, Wencheng oth Xin, Chunlin oth Zhu, Binhai 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:734 year:2018 day:22 month:07 pages:15-23 extent:9 https://doi.org/10.1016/j.tcs.2017.10.018 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 734 2018 22 0722 15-23 9 |
| spelling |
10.1016/j.tcs.2017.10.018 doi GBV00000000000690.pica (DE-627)ELV043321771 (ELSEVIER)S0304-3975(17)30746-6 DE-627 ger DE-627 rakwb eng 620 VZ 690 VZ 50.92 bkl Zou, Peng verfasserin aut Finding disjoint dense clubs in a social network 2018transfer abstract 9 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier In a social network, the trust among its members usually cannot be carried over many hops. So it is important to find disjoint clusters with a small diameter and with a decent size, formally called dense clubs. We focus on handling this NP-complete problem in this paper. First, from the parameterized computational complexity point of view, we show that this problem does not admit a polynomial kernel (implying that it is unlikely to apply some reduction rules to obtain a practically small problem size). Then, we focus on the dual version of the problem, i.e., deleting d vertices to obtain some isolated dense clubs. We show that this dual problem admits a simple FPT algorithm using a bounded search tree method (the running time is still too high for practical datasets). Finally, we combine a simple reduction rule together with two branching rules to obtain a practical solution (verified by extensive testing on practical datasets). In a social network, the trust among its members usually cannot be carried over many hops. So it is important to find disjoint clusters with a small diameter and with a decent size, formally called dense clubs. We focus on handling this NP-complete problem in this paper. First, from the parameterized computational complexity point of view, we show that this problem does not admit a polynomial kernel (implying that it is unlikely to apply some reduction rules to obtain a practically small problem size). Then, we focus on the dual version of the problem, i.e., deleting d vertices to obtain some isolated dense clubs. We show that this dual problem admits a simple FPT algorithm using a bounded search tree method (the running time is still too high for practical datasets). Finally, we combine a simple reduction rule together with two branching rules to obtain a practical solution (verified by extensive testing on practical datasets). FPT algorithms Elsevier Clusters Elsevier Social networks Elsevier Clubs Elsevier Kernelization Elsevier Li, Hui oth Wang, Wencheng oth Xin, Chunlin oth Zhu, Binhai 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:734 year:2018 day:22 month:07 pages:15-23 extent:9 https://doi.org/10.1016/j.tcs.2017.10.018 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 734 2018 22 0722 15-23 9 |
| allfields_unstemmed |
10.1016/j.tcs.2017.10.018 doi GBV00000000000690.pica (DE-627)ELV043321771 (ELSEVIER)S0304-3975(17)30746-6 DE-627 ger DE-627 rakwb eng 620 VZ 690 VZ 50.92 bkl Zou, Peng verfasserin aut Finding disjoint dense clubs in a social network 2018transfer abstract 9 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier In a social network, the trust among its members usually cannot be carried over many hops. So it is important to find disjoint clusters with a small diameter and with a decent size, formally called dense clubs. We focus on handling this NP-complete problem in this paper. First, from the parameterized computational complexity point of view, we show that this problem does not admit a polynomial kernel (implying that it is unlikely to apply some reduction rules to obtain a practically small problem size). Then, we focus on the dual version of the problem, i.e., deleting d vertices to obtain some isolated dense clubs. We show that this dual problem admits a simple FPT algorithm using a bounded search tree method (the running time is still too high for practical datasets). Finally, we combine a simple reduction rule together with two branching rules to obtain a practical solution (verified by extensive testing on practical datasets). In a social network, the trust among its members usually cannot be carried over many hops. So it is important to find disjoint clusters with a small diameter and with a decent size, formally called dense clubs. We focus on handling this NP-complete problem in this paper. First, from the parameterized computational complexity point of view, we show that this problem does not admit a polynomial kernel (implying that it is unlikely to apply some reduction rules to obtain a practically small problem size). Then, we focus on the dual version of the problem, i.e., deleting d vertices to obtain some isolated dense clubs. We show that this dual problem admits a simple FPT algorithm using a bounded search tree method (the running time is still too high for practical datasets). Finally, we combine a simple reduction rule together with two branching rules to obtain a practical solution (verified by extensive testing on practical datasets). FPT algorithms Elsevier Clusters Elsevier Social networks Elsevier Clubs Elsevier Kernelization Elsevier Li, Hui oth Wang, Wencheng oth Xin, Chunlin oth Zhu, Binhai 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:734 year:2018 day:22 month:07 pages:15-23 extent:9 https://doi.org/10.1016/j.tcs.2017.10.018 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 734 2018 22 0722 15-23 9 |
| allfieldsGer |
10.1016/j.tcs.2017.10.018 doi GBV00000000000690.pica (DE-627)ELV043321771 (ELSEVIER)S0304-3975(17)30746-6 DE-627 ger DE-627 rakwb eng 620 VZ 690 VZ 50.92 bkl Zou, Peng verfasserin aut Finding disjoint dense clubs in a social network 2018transfer abstract 9 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier In a social network, the trust among its members usually cannot be carried over many hops. So it is important to find disjoint clusters with a small diameter and with a decent size, formally called dense clubs. We focus on handling this NP-complete problem in this paper. First, from the parameterized computational complexity point of view, we show that this problem does not admit a polynomial kernel (implying that it is unlikely to apply some reduction rules to obtain a practically small problem size). Then, we focus on the dual version of the problem, i.e., deleting d vertices to obtain some isolated dense clubs. We show that this dual problem admits a simple FPT algorithm using a bounded search tree method (the running time is still too high for practical datasets). Finally, we combine a simple reduction rule together with two branching rules to obtain a practical solution (verified by extensive testing on practical datasets). In a social network, the trust among its members usually cannot be carried over many hops. So it is important to find disjoint clusters with a small diameter and with a decent size, formally called dense clubs. We focus on handling this NP-complete problem in this paper. First, from the parameterized computational complexity point of view, we show that this problem does not admit a polynomial kernel (implying that it is unlikely to apply some reduction rules to obtain a practically small problem size). Then, we focus on the dual version of the problem, i.e., deleting d vertices to obtain some isolated dense clubs. We show that this dual problem admits a simple FPT algorithm using a bounded search tree method (the running time is still too high for practical datasets). Finally, we combine a simple reduction rule together with two branching rules to obtain a practical solution (verified by extensive testing on practical datasets). FPT algorithms Elsevier Clusters Elsevier Social networks Elsevier Clubs Elsevier Kernelization Elsevier Li, Hui oth Wang, Wencheng oth Xin, Chunlin oth Zhu, Binhai 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:734 year:2018 day:22 month:07 pages:15-23 extent:9 https://doi.org/10.1016/j.tcs.2017.10.018 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 734 2018 22 0722 15-23 9 |
| allfieldsSound |
10.1016/j.tcs.2017.10.018 doi GBV00000000000690.pica (DE-627)ELV043321771 (ELSEVIER)S0304-3975(17)30746-6 DE-627 ger DE-627 rakwb eng 620 VZ 690 VZ 50.92 bkl Zou, Peng verfasserin aut Finding disjoint dense clubs in a social network 2018transfer abstract 9 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier In a social network, the trust among its members usually cannot be carried over many hops. So it is important to find disjoint clusters with a small diameter and with a decent size, formally called dense clubs. We focus on handling this NP-complete problem in this paper. First, from the parameterized computational complexity point of view, we show that this problem does not admit a polynomial kernel (implying that it is unlikely to apply some reduction rules to obtain a practically small problem size). Then, we focus on the dual version of the problem, i.e., deleting d vertices to obtain some isolated dense clubs. We show that this dual problem admits a simple FPT algorithm using a bounded search tree method (the running time is still too high for practical datasets). Finally, we combine a simple reduction rule together with two branching rules to obtain a practical solution (verified by extensive testing on practical datasets). In a social network, the trust among its members usually cannot be carried over many hops. So it is important to find disjoint clusters with a small diameter and with a decent size, formally called dense clubs. We focus on handling this NP-complete problem in this paper. First, from the parameterized computational complexity point of view, we show that this problem does not admit a polynomial kernel (implying that it is unlikely to apply some reduction rules to obtain a practically small problem size). Then, we focus on the dual version of the problem, i.e., deleting d vertices to obtain some isolated dense clubs. We show that this dual problem admits a simple FPT algorithm using a bounded search tree method (the running time is still too high for practical datasets). Finally, we combine a simple reduction rule together with two branching rules to obtain a practical solution (verified by extensive testing on practical datasets). FPT algorithms Elsevier Clusters Elsevier Social networks Elsevier Clubs Elsevier Kernelization Elsevier Li, Hui oth Wang, Wencheng oth Xin, Chunlin oth Zhu, Binhai 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:734 year:2018 day:22 month:07 pages:15-23 extent:9 https://doi.org/10.1016/j.tcs.2017.10.018 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 734 2018 22 0722 15-23 9 |
| 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:734 year:2018 day:22 month:07 pages:15-23 extent:9 |
| 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:734 year:2018 day:22 month:07 pages:15-23 extent:9 |
| format_phy_str_mv |
Article |
| bklname |
Meerestechnik |
| institution |
findex.gbv.de |
| topic_facet |
FPT algorithms Clusters Social networks Clubs Kernelization |
| dewey-raw |
620 |
| 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 |
Zou, Peng @@aut@@ Li, Hui @@oth@@ Wang, Wencheng @@oth@@ Xin, Chunlin @@oth@@ Zhu, Binhai @@oth@@ |
| publishDateDaySort_date |
2018-01-22T00:00:00Z |
| hierarchy_top_id |
ELV013125583 |
| dewey-sort |
3620 |
| id |
ELV043321771 |
| 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">ELV043321771</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230626003509.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180726s2018 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.tcs.2017.10.018</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBV00000000000690.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV043321771</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0304-3975(17)30746-6</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">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">Zou, Peng</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Finding disjoint dense clubs in a social network</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2018transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">9</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">In a social network, the trust among its members usually cannot be carried over many hops. So it is important to find disjoint clusters with a small diameter and with a decent size, formally called dense clubs. We focus on handling this NP-complete problem in this paper. First, from the parameterized computational complexity point of view, we show that this problem does not admit a polynomial kernel (implying that it is unlikely to apply some reduction rules to obtain a practically small problem size). Then, we focus on the dual version of the problem, i.e., deleting d vertices to obtain some isolated dense clubs. We show that this dual problem admits a simple FPT algorithm using a bounded search tree method (the running time is still too high for practical datasets). Finally, we combine a simple reduction rule together with two branching rules to obtain a practical solution (verified by extensive testing on practical datasets).</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In a social network, the trust among its members usually cannot be carried over many hops. So it is important to find disjoint clusters with a small diameter and with a decent size, formally called dense clubs. We focus on handling this NP-complete problem in this paper. First, from the parameterized computational complexity point of view, we show that this problem does not admit a polynomial kernel (implying that it is unlikely to apply some reduction rules to obtain a practically small problem size). Then, we focus on the dual version of the problem, i.e., deleting d vertices to obtain some isolated dense clubs. We show that this dual problem admits a simple FPT algorithm using a bounded search tree method (the running time is still too high for practical datasets). Finally, we combine a simple reduction rule together with two branching rules to obtain a practical solution (verified by extensive testing on practical datasets).</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">FPT algorithms</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Clusters</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Social networks</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Clubs</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Kernelization</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Li, Hui</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Wencheng</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Xin, Chunlin</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhu, Binhai</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:734</subfield><subfield code="g">year:2018</subfield><subfield code="g">day:22</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:15-23</subfield><subfield code="g">extent:9</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.tcs.2017.10.018</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">734</subfield><subfield code="j">2018</subfield><subfield code="b">22</subfield><subfield code="c">0722</subfield><subfield code="h">15-23</subfield><subfield code="g">9</subfield></datafield></record></collection>
|
| author |
Zou, Peng |
| spellingShingle |
Zou, Peng ddc 620 ddc 690 bkl 50.92 Elsevier FPT algorithms Elsevier Clusters Elsevier Social networks Elsevier Clubs Elsevier Kernelization Finding disjoint dense clubs in a social network |
| authorStr |
Zou, Peng |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)ELV013125583 |
| format |
electronic Article |
| dewey-ones |
620 - Engineering & allied operations 690 - Buildings |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
elsevier |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
620 VZ 690 VZ 50.92 bkl Finding disjoint dense clubs in a social network FPT algorithms Elsevier Clusters Elsevier Social networks Elsevier Clubs Elsevier Kernelization Elsevier |
| topic |
ddc 620 ddc 690 bkl 50.92 Elsevier FPT algorithms Elsevier Clusters Elsevier Social networks Elsevier Clubs Elsevier Kernelization |
| topic_unstemmed |
ddc 620 ddc 690 bkl 50.92 Elsevier FPT algorithms Elsevier Clusters Elsevier Social networks Elsevier Clubs Elsevier Kernelization |
| topic_browse |
ddc 620 ddc 690 bkl 50.92 Elsevier FPT algorithms Elsevier Clusters Elsevier Social networks Elsevier Clubs Elsevier Kernelization |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| author2_variant |
h l hl w w ww c x cx b z bz |
| 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 |
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 disjoint dense clubs in a social network |
| ctrlnum |
(DE-627)ELV043321771 (ELSEVIER)S0304-3975(17)30746-6 |
| title_full |
Finding disjoint dense clubs in a social network |
| author_sort |
Zou, Peng |
| 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 |
600 - Technology |
| recordtype |
marc |
| publishDateSort |
2018 |
| contenttype_str_mv |
zzz |
| container_start_page |
15 |
| author_browse |
Zou, Peng |
| container_volume |
734 |
| physical |
9 |
| class |
620 VZ 690 VZ 50.92 bkl |
| format_se |
Elektronische Aufsätze |
| author-letter |
Zou, Peng |
| doi_str_mv |
10.1016/j.tcs.2017.10.018 |
| dewey-full |
620 690 |
| title_sort |
finding disjoint dense clubs in a social network |
| title_auth |
Finding disjoint dense clubs in a social network |
| abstract |
In a social network, the trust among its members usually cannot be carried over many hops. So it is important to find disjoint clusters with a small diameter and with a decent size, formally called dense clubs. We focus on handling this NP-complete problem in this paper. First, from the parameterized computational complexity point of view, we show that this problem does not admit a polynomial kernel (implying that it is unlikely to apply some reduction rules to obtain a practically small problem size). Then, we focus on the dual version of the problem, i.e., deleting d vertices to obtain some isolated dense clubs. We show that this dual problem admits a simple FPT algorithm using a bounded search tree method (the running time is still too high for practical datasets). Finally, we combine a simple reduction rule together with two branching rules to obtain a practical solution (verified by extensive testing on practical datasets). |
| abstractGer |
In a social network, the trust among its members usually cannot be carried over many hops. So it is important to find disjoint clusters with a small diameter and with a decent size, formally called dense clubs. We focus on handling this NP-complete problem in this paper. First, from the parameterized computational complexity point of view, we show that this problem does not admit a polynomial kernel (implying that it is unlikely to apply some reduction rules to obtain a practically small problem size). Then, we focus on the dual version of the problem, i.e., deleting d vertices to obtain some isolated dense clubs. We show that this dual problem admits a simple FPT algorithm using a bounded search tree method (the running time is still too high for practical datasets). Finally, we combine a simple reduction rule together with two branching rules to obtain a practical solution (verified by extensive testing on practical datasets). |
| abstract_unstemmed |
In a social network, the trust among its members usually cannot be carried over many hops. So it is important to find disjoint clusters with a small diameter and with a decent size, formally called dense clubs. We focus on handling this NP-complete problem in this paper. First, from the parameterized computational complexity point of view, we show that this problem does not admit a polynomial kernel (implying that it is unlikely to apply some reduction rules to obtain a practically small problem size). Then, we focus on the dual version of the problem, i.e., deleting d vertices to obtain some isolated dense clubs. We show that this dual problem admits a simple FPT algorithm using a bounded search tree method (the running time is still too high for practical datasets). Finally, we combine a simple reduction rule together with two branching rules to obtain a practical solution (verified by extensive testing on practical datasets). |
| collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 |
| title_short |
Finding disjoint dense clubs in a social network |
| url |
https://doi.org/10.1016/j.tcs.2017.10.018 |
| remote_bool |
true |
| author2 |
Li, Hui Wang, Wencheng Xin, Chunlin Zhu, Binhai |
| author2Str |
Li, Hui Wang, Wencheng Xin, Chunlin Zhu, Binhai |
| ppnlink |
ELV013125583 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth oth oth |
| doi_str |
10.1016/j.tcs.2017.10.018 |
| up_date |
2024-07-06T18:31:05.673Z |
| _version_ |
1803855505050828800 |
| 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">ELV043321771</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230626003509.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180726s2018 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.tcs.2017.10.018</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBV00000000000690.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV043321771</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0304-3975(17)30746-6</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">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">Zou, Peng</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Finding disjoint dense clubs in a social network</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2018transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">9</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">In a social network, the trust among its members usually cannot be carried over many hops. So it is important to find disjoint clusters with a small diameter and with a decent size, formally called dense clubs. We focus on handling this NP-complete problem in this paper. First, from the parameterized computational complexity point of view, we show that this problem does not admit a polynomial kernel (implying that it is unlikely to apply some reduction rules to obtain a practically small problem size). Then, we focus on the dual version of the problem, i.e., deleting d vertices to obtain some isolated dense clubs. We show that this dual problem admits a simple FPT algorithm using a bounded search tree method (the running time is still too high for practical datasets). Finally, we combine a simple reduction rule together with two branching rules to obtain a practical solution (verified by extensive testing on practical datasets).</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In a social network, the trust among its members usually cannot be carried over many hops. So it is important to find disjoint clusters with a small diameter and with a decent size, formally called dense clubs. We focus on handling this NP-complete problem in this paper. First, from the parameterized computational complexity point of view, we show that this problem does not admit a polynomial kernel (implying that it is unlikely to apply some reduction rules to obtain a practically small problem size). Then, we focus on the dual version of the problem, i.e., deleting d vertices to obtain some isolated dense clubs. We show that this dual problem admits a simple FPT algorithm using a bounded search tree method (the running time is still too high for practical datasets). Finally, we combine a simple reduction rule together with two branching rules to obtain a practical solution (verified by extensive testing on practical datasets).</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">FPT algorithms</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Clusters</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Social networks</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Clubs</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Kernelization</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Li, Hui</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Wencheng</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Xin, Chunlin</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhu, Binhai</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:734</subfield><subfield code="g">year:2018</subfield><subfield code="g">day:22</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:15-23</subfield><subfield code="g">extent:9</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.tcs.2017.10.018</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">734</subfield><subfield code="j">2018</subfield><subfield code="b">22</subfield><subfield code="c">0722</subfield><subfield code="h">15-23</subfield><subfield code="g">9</subfield></datafield></record></collection>
|
| score |
7.3995123 |