Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon.
Narayan VikasPublished in: MFCS (2017)
Keyphrases
- vertex set
- computational complexity
- directed graph
- undirected graph
- partitioning algorithm
- weighted graph
- hamiltonian cycle
- minimum weight
- labeled graphs
- random walk
- graph model
- graph structure
- np complete
- structured data
- connected components
- bipartite graph
- graph theory
- special case
- computational cost
- directed acyclic graph
- attributed graphs
- edge weights
- high computational complexity
- decision problems
- maximum cardinality
- average degree
- social network analysis
- spanning tree
- rate distortion
- link analysis
- computational efficiency
- pairwise
- search algorithm
- memory requirements