H. Nagamochi

activity

20122023

most citedExact Algorithms for Maximum Independent Set

143 citations · 198 across the 19 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

cs.DS2018★ 11 cited

Characterizing Star-PCGs

Mingyu Xiao, Hiroshi Nagamochi

A graph $G$ is called a pairwise compatibility graph (PCG, for short) if it admits a tuple $(T, w, d_{m i n}, d_{m a x})$ of a tree $T$ whose leaf set is equal to the vertex set of $G$ …

cs.DS2018★ 1 cited

Some Reduction Operations to Pairwise Compatibility Graphs

Mingyu Xiao, Hiroshi Nagamochi

A graph $G = (V, E)$ with a vertex set $V$ and an edge set $E$ is called a pairwise compatibility graph (PCG, for short) if there are a tree $T$ whose leaf set is $V$ , a non-negative…