Login / Signup
-Bounded Coloring of Split Graphs.
Bor-Liang Chen
Ming-Tat Ko
Ko-Wei Lih
Published in:
Combinatorics and Computer Science (1995)
Keyphrases
</>
graph matching
graph theory
directed graph
data mining
undirected graph
bounded treewidth
graph structures
graph model
graph databases
dynamic graph
real time
graph properties
asymptotically optimal
graph theoretic
multi objective
bayesian networks
similarity measure
case study
databases
data sets