DP-based wordgraph pruning

Compound noun segmentation is a key component for Korean language processing. Supervised approaches require some types of human intervention such as maintaining lexicons, manually segmenting the corpora, or devising heuristic rules. Thus, they suffer ...

In order to solve a question on list coloring of planar graphs, Dvořák and Postle introduced the concept of so called DP-coloring, thereby extending the concept of list-coloring. DP-coloring was analyzed in detail by Bernshteyn, ...

In (J Graph Theory 4:241–242, 1980), Burr proved that $\chi (G)\le m_1{m}_2\dots m_k$ if and only if G is the edge-disjoint union of k graphs $G_1,G_2,\dots ,G_k$ such that $\chi (G_i)\le m_i$ for $1\le i\le k$. This result established the practice of describing the chromatic number of a graph ...${}_{\mathrm{}}{}_{\mathrm{}}{}_{}$