Old Web
English
Sign In
Acemap
>
Paper
>
AS-1-3 A 3/2-Approximation Algorithm for the Bipartite Dense Subgraph Problem on Bipartite Permutation Graphs
AS-1-3 A 3/2-Approximation Algorithm for the Bipartite Dense Subgraph Problem on Bipartite Permutation Graphs
2016
Yuta Inaba
Satoshi Tayu
Shuichi Ueno
Keywords:
Complete bipartite graph
Induced subgraph isomorphism problem
3-dimensional matching
Blossom algorithm
Permutation graph
Hopcroft–Karp algorithm
Combinatorics
Matching (graph theory)
Mathematics
Bipartite graph
Subgraph isomorphism problem
Dense graph
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]