Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs.
Jun KawaharaToshiki SaitohHirokazu TakedaRyo YoshinakaYui YoshiokaPublished in: CoRR (2022)
Keyphrases
- graph theory
- computationally efficient
- graph data
- maximal clique enumeration
- graph structure
- maximum clique
- maximal cliques
- random graphs
- directed graph
- dynamic graph
- graph isomorphism
- graph structures
- graph construction
- graph theoretic
- data structure
- planar graphs
- weighted graph
- learning algorithm
- graph matching
- graph representation
- web graph
- graph mining
- bipartite graph
- polynomial time complexity
- subgraph mining
- massive graphs
- undirected graph
- graph databases
- subgraph isomorphism
- series parallel
- graph partitioning
- graph layout
- maximum cardinality
- minimum spanning tree