Geewon Suh

activity

20142020

most citedMC2G: An Efficient Algorithm for Matrix Completion with Social and Item Similarity Graphs

19 citations · 25 across the 4 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

math.CO2016★ 1 cited

Characterizing graphs of maximum matching width at most 2

Jisu Jeong, Seongmin Ok, Geewon Suh

The maximum matching width is a width-parameter that is defined on a branch-decomposition over the vertex set of a graph. The size of a maximum matching in the bipartite graph is u…

math.CO2016★ 3 cited

Sparse spanning $k$ -connected subgraphs in tournaments

Dong Yeap Kang, Jaehoon Kim, Younjin Kim +1

In 2009, Bang-Jensen asked whether there exists a function $g (k)$ such that every strongly $k$ -connected $n$ -vertex tournament contains a strongly $k$ -connected spanning subgraph w…

Characterizing graphs of maximum matching width at most 2

Sparse spanning k-connected subgraphs in tournaments

Sparse spanning $k$ -connected subgraphs in tournaments