Finding cut-vertices in the square roots of a graph.
Guillaume DucoffePublished in: Discret. Appl. Math. (2019)
Keyphrases
- planar graphs
- weighted graph
- vertex set
- adjacency matrix
- minimum cut
- edge weights
- undirected graph
- labeled graphs
- graph theoretic
- bipartite graph
- directed edges
- graph theory
- random graphs
- strongly connected
- maximum clique
- hamiltonian cycle
- average degree
- normalized cut
- spanning tree
- minimum weight
- directed acyclic graph
- directed graph
- optimal solution
- maximal cliques
- subgraph isomorphism
- graph partitioning
- attributed graphs
- graph model
- graph structure
- connected components
- structured data
- connected subgraphs
- random walk