Monopolar graphs: Complexity of computing classical graph parameters.
Michele BarbatoDario BezziPublished in: Discret. Appl. Math. (2021)
Keyphrases
- graph representation
- graph theory
- directed graph
- graph matching
- weighted graph
- labeled graphs
- polynomial time complexity
- graph structure
- graph model
- bipartite graph
- graph theoretic
- graph mining
- adjacency matrix
- graph search
- graph properties
- random graphs
- graph construction
- graph databases
- graph theoretical
- series parallel
- graph classification
- graph partitioning
- undirected graph
- graph representations
- graph isomorphism
- graph structures
- real world graphs
- community discovery
- evolving graphs
- graph transformation
- social graphs
- disk resident
- graph drawing
- reachability queries
- structural pattern recognition
- maximum common subgraph
- subgraph isomorphism
- random walk
- graph clustering
- spanning tree
- directed acyclic graph
- maximum likelihood
- inexact graph matching
- connected graphs
- np complete
- minimum spanning tree
- graph embedding
- average degree
- edge weights
- association graph
- pattern mining
- proximity graph
- graph connectivity
- graph layout
- neighborhood graph
- maximum cardinality
- frequent subgraphs
- finding the shortest path
- adjacency graph
- homology generators
- strongly connected