Presentation 2014-11-20
On the Bipartite Dense Subgraph Problem
Satoshi TAYU, Asahi TAKAOKA, Dai ITO, Shuichi UENO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The bipartite dense subgraph problem is a variant of the dense subgraph problem, which has a long history, and is widely studied in the literature. The bipartite dense subgraph problem is known to be NP-hard, and some efficient approximation algorithms are proposed. This paper shows that the bipartite dense subgraph problem is NP-hard even for chordal bipartite graphs. We also show that the problem is solvable in O(n^5) time for n-vertex trees.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) bipartite dense subgraph / dense subgraph / NP-hard / polynomial time algorithm
Paper # CAS2014-94,MSS2014-58
Date of Issue

Conference Information
Committee CAS
Conference Date 2014/11/13(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Circuits and Systems (CAS)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On the Bipartite Dense Subgraph Problem
Sub Title (in English)
Keyword(1) bipartite dense subgraph
Keyword(2) dense subgraph
Keyword(3) NP-hard
Keyword(4) polynomial time algorithm
1st Author's Name Satoshi TAYU
1st Author's Affiliation Department of Communications and Computer Engineering Tokyo Institute of Technology()
2nd Author's Name Asahi TAKAOKA
2nd Author's Affiliation Department of Communications and Computer Engineering Tokyo Institute of Technology
3rd Author's Name Dai ITO
3rd Author's Affiliation Department of Communications and Computer Engineering Tokyo Institute of Technology
4th Author's Name Shuichi UENO
4th Author's Affiliation Department of Communications and Computer Engineering Tokyo Institute of Technology
Date 2014-11-20
Paper # CAS2014-94,MSS2014-58
Volume (vol) vol.114
Number (no) 312
Page pp.pp.-
#Pages 6
Date of Issue