Efficient non-isomorphic graph enumeration algorithms for several intersection graph classes.
Jun KawaharaToshiki SaitohHirokazu TakedaRyo YoshinakaYui YoshiokaPublished in: Theor. Comput. Sci. (2024)
Keyphrases
- graph theory
- equivalence classes
- maximal clique enumeration
- computationally efficient
- graph layout
- breadth first search
- random walk
- maximum flow
- graph search
- graph model
- graph theoretic
- graph properties
- maximal cliques
- minimum spanning tree
- highly efficient
- bipartite graph
- depth first search
- optimization problems
- computationally expensive
- connected components
- graph representation
- learning algorithm
- polynomial time complexity
- maximum weight
- partitioning algorithm
- computational cost
- link analysis
- structured data
- graph construction
- graph structure
- random graphs
- directed graph
- graph databases
- web graph
- pruning strategy
- multi class
- planar graphs
- graph data
- edge weights
- graph based algorithm
- maximum clique
- pairwise
- computational complexity
- decision trees