Finding dense and connected subgraphs in dual networks

Yubao Wu, Ruoming Jin, Xiaofeng Zhu, Xiang Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Citations (Scopus)

Abstract

Finding dense subgraphs is an important problem that has recently attracted a lot of interests. Most of the existing work focuses on a single graph (or network1). In many real-life applications, however, there exist dual networks, in which one network represents the physical world and another network represents the conceptual world. In this paper, we investigate the problem of finding the densest connected subgraph (DCS) which has the largest density in the conceptual network and is also connected in the physical network. Such pattern cannot be identified using the existing algorithms for a single network. We show that even though finding the densest subgraph in a single network is polynomial time solvable, the DCS problem is NP-hard. We develop a two-step approach to solve the DCS problem. In the first step, we effectively prune the dual networks while guarantee that the optimal solution is contained in the remaining networks. For the second step, we develop two efficient greedy methods based on different search strategies to find the DCS. Different variations of the DCS problem are also studied. We perform extensive experiments on a variety of real and synthetic dual networks to evaluate the effectiveness and efficiency of the developed methods.

Original languageEnglish (US)
Title of host publication2015 IEEE 31st International Conference on Data Engineering, ICDE 2015
PublisherIEEE Computer Society
Pages915-926
Number of pages12
ISBN (Electronic)9781479979639
DOIs
StatePublished - May 26 2015
Event2015 31st IEEE International Conference on Data Engineering, ICDE 2015 - Seoul, Korea, Republic of
Duration: Apr 13 2015Apr 17 2015

Publication series

NameProceedings - International Conference on Data Engineering
Volume2015-May
ISSN (Print)1084-4627

Other

Other2015 31st IEEE International Conference on Data Engineering, ICDE 2015
CountryKorea, Republic of
CitySeoul
Period4/13/154/17/15

Fingerprint

Computational complexity
Polynomials
Experiments

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Information Systems

Cite this

Wu, Y., Jin, R., Zhu, X., & Zhang, X. (2015). Finding dense and connected subgraphs in dual networks. In 2015 IEEE 31st International Conference on Data Engineering, ICDE 2015 (pp. 915-926). [7113344] (Proceedings - International Conference on Data Engineering; Vol. 2015-May). IEEE Computer Society. https://doi.org/10.1109/ICDE.2015.7113344
Wu, Yubao ; Jin, Ruoming ; Zhu, Xiaofeng ; Zhang, Xiang. / Finding dense and connected subgraphs in dual networks. 2015 IEEE 31st International Conference on Data Engineering, ICDE 2015. IEEE Computer Society, 2015. pp. 915-926 (Proceedings - International Conference on Data Engineering).
@inproceedings{ff1e0318cd134429a8243778e7ef6dcc,
title = "Finding dense and connected subgraphs in dual networks",
abstract = "Finding dense subgraphs is an important problem that has recently attracted a lot of interests. Most of the existing work focuses on a single graph (or network1). In many real-life applications, however, there exist dual networks, in which one network represents the physical world and another network represents the conceptual world. In this paper, we investigate the problem of finding the densest connected subgraph (DCS) which has the largest density in the conceptual network and is also connected in the physical network. Such pattern cannot be identified using the existing algorithms for a single network. We show that even though finding the densest subgraph in a single network is polynomial time solvable, the DCS problem is NP-hard. We develop a two-step approach to solve the DCS problem. In the first step, we effectively prune the dual networks while guarantee that the optimal solution is contained in the remaining networks. For the second step, we develop two efficient greedy methods based on different search strategies to find the DCS. Different variations of the DCS problem are also studied. We perform extensive experiments on a variety of real and synthetic dual networks to evaluate the effectiveness and efficiency of the developed methods.",
author = "Yubao Wu and Ruoming Jin and Xiaofeng Zhu and Xiang Zhang",
year = "2015",
month = "5",
day = "26",
doi = "10.1109/ICDE.2015.7113344",
language = "English (US)",
series = "Proceedings - International Conference on Data Engineering",
publisher = "IEEE Computer Society",
pages = "915--926",
booktitle = "2015 IEEE 31st International Conference on Data Engineering, ICDE 2015",
address = "United States",

}

Wu, Y, Jin, R, Zhu, X & Zhang, X 2015, Finding dense and connected subgraphs in dual networks. in 2015 IEEE 31st International Conference on Data Engineering, ICDE 2015., 7113344, Proceedings - International Conference on Data Engineering, vol. 2015-May, IEEE Computer Society, pp. 915-926, 2015 31st IEEE International Conference on Data Engineering, ICDE 2015, Seoul, Korea, Republic of, 4/13/15. https://doi.org/10.1109/ICDE.2015.7113344

Finding dense and connected subgraphs in dual networks. / Wu, Yubao; Jin, Ruoming; Zhu, Xiaofeng; Zhang, Xiang.

2015 IEEE 31st International Conference on Data Engineering, ICDE 2015. IEEE Computer Society, 2015. p. 915-926 7113344 (Proceedings - International Conference on Data Engineering; Vol. 2015-May).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Finding dense and connected subgraphs in dual networks

AU - Wu, Yubao

AU - Jin, Ruoming

AU - Zhu, Xiaofeng

AU - Zhang, Xiang

PY - 2015/5/26

Y1 - 2015/5/26

N2 - Finding dense subgraphs is an important problem that has recently attracted a lot of interests. Most of the existing work focuses on a single graph (or network1). In many real-life applications, however, there exist dual networks, in which one network represents the physical world and another network represents the conceptual world. In this paper, we investigate the problem of finding the densest connected subgraph (DCS) which has the largest density in the conceptual network and is also connected in the physical network. Such pattern cannot be identified using the existing algorithms for a single network. We show that even though finding the densest subgraph in a single network is polynomial time solvable, the DCS problem is NP-hard. We develop a two-step approach to solve the DCS problem. In the first step, we effectively prune the dual networks while guarantee that the optimal solution is contained in the remaining networks. For the second step, we develop two efficient greedy methods based on different search strategies to find the DCS. Different variations of the DCS problem are also studied. We perform extensive experiments on a variety of real and synthetic dual networks to evaluate the effectiveness and efficiency of the developed methods.

AB - Finding dense subgraphs is an important problem that has recently attracted a lot of interests. Most of the existing work focuses on a single graph (or network1). In many real-life applications, however, there exist dual networks, in which one network represents the physical world and another network represents the conceptual world. In this paper, we investigate the problem of finding the densest connected subgraph (DCS) which has the largest density in the conceptual network and is also connected in the physical network. Such pattern cannot be identified using the existing algorithms for a single network. We show that even though finding the densest subgraph in a single network is polynomial time solvable, the DCS problem is NP-hard. We develop a two-step approach to solve the DCS problem. In the first step, we effectively prune the dual networks while guarantee that the optimal solution is contained in the remaining networks. For the second step, we develop two efficient greedy methods based on different search strategies to find the DCS. Different variations of the DCS problem are also studied. We perform extensive experiments on a variety of real and synthetic dual networks to evaluate the effectiveness and efficiency of the developed methods.

UR - http://www.scopus.com/inward/record.url?scp=84940837578&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84940837578&partnerID=8YFLogxK

U2 - 10.1109/ICDE.2015.7113344

DO - 10.1109/ICDE.2015.7113344

M3 - Conference contribution

AN - SCOPUS:84940837578

T3 - Proceedings - International Conference on Data Engineering

SP - 915

EP - 926

BT - 2015 IEEE 31st International Conference on Data Engineering, ICDE 2015

PB - IEEE Computer Society

ER -

Wu Y, Jin R, Zhu X, Zhang X. Finding dense and connected subgraphs in dual networks. In 2015 IEEE 31st International Conference on Data Engineering, ICDE 2015. IEEE Computer Society. 2015. p. 915-926. 7113344. (Proceedings - International Conference on Data Engineering). https://doi.org/10.1109/ICDE.2015.7113344