14 citations · 16 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2023
Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs
Eunjin Oh, Seunghyeok Oh
In this paper, we study the maximum clique problem on hyperbolic random graphs. A hyperbolic random graph is a mathematical model for analyzing scale-free networks since it effecti…
cs.DS2022
Parameterized Algorithm for the Disjoint Path Problem on Planar Graphs: Exponential in and Linear in
Kyungjin Cho, Eunjin Oh, Seunghyeok Oh
In this paper, we study the \textsf{Planar Disjoint Paths} problem: Given an undirected planar graph with vertices and a set of pairs of vertice…