A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of thresholds graphs.
Yury MetelskyKseniya SchemelevaFrank WernerPublished in: Discuss. Math. Graph Theory (2017)
Keyphrases
- graph theory
- recognition rate
- activity recognition
- finite number
- pattern recognition
- connected graphs
- subgraph isomorphism
- automatic recognition
- graph databases
- graph structure
- weighted graph
- recognition accuracy
- graph mining
- directed graph
- graph partitioning
- structured data
- object recognition
- planar graphs
- half spaces
- feature extraction