Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs.
Jun KawaharaToshiki SaitohHirokazu TakedaRyo YoshinakaYui YoshiokaPublished in: WALCOM (2023)
Keyphrases
- graph theory
- maximal clique enumeration
- computationally efficient
- graph theoretic
- maximal cliques
- graph model
- polynomial time complexity
- graph isomorphism
- graph structures
- graph representation
- graph embedding
- graph theoretical
- depth first search
- graph search
- web graph
- subgraph isomorphism
- graph matching
- directed graph
- random walk
- series parallel
- maximum clique
- graph properties
- social networks
- learning algorithm
- graph partitioning
- graph mining
- graph construction
- np complete
- labeled graphs
- maximum cardinality
- subgraph mining
- dynamic graph
- graph drawing
- data structure
- graphical models
- bipartite graph
- planar graphs
- graph structure
- bounded treewidth
- graph databases
- spanning tree
- graph data
- minimum spanning tree