Strong triadic closure in cographs and graphs of low maximum degree.
Athanasios L. KonstantinidisStavros D. NikolopoulosCharis PapadopoulosPublished in: Theor. Comput. Sci. (2018)
Keyphrases
- low degree
- random graphs
- graph matching
- graph theoretic
- graph model
- graph theory
- complex structures
- bipartite graph
- series parallel
- maximal cliques
- graph databases
- graph structure
- databases
- directed graph
- np hard
- pattern recognition
- search algorithm
- bayesian networks
- high level
- case study
- information retrieval
- neural network