Berge-Fulkerson coloring for C ( 12 ) -linked permutation graphs.
Siyan LiuRong-Xia HaoCun-Quan ZhangZhang ZhangPublished in: J. Graph Theory (2021)
Keyphrases
- graph theoretic
- directed graph
- graph matching
- graph theory
- graph databases
- graph mining
- connected graphs
- graph representation
- graph model
- series parallel
- weighted graph
- graph structure
- greedy algorithm
- social network analysis
- lower bound
- case study
- random graphs
- graph structures
- structured objects
- graph isomorphism
- real time