On the Complexity of List H-Packing for Sparse Graph Classes.
Tatsuya GimaTesshu HanakaYasuaki KobayashiYota OtachiTomohito ShiraiAkira SuzukiYuma TamuraXiao ZhouPublished in: WALCOM (2024)
Keyphrases
- graph representation
- tractable cases
- worst case
- equivalence classes
- connected components
- complexity measures
- graph model
- graph structure
- graph theory
- bipartite graph
- gaussian graphical models
- directed acyclic
- clustering algorithm
- directed graph
- decision problems
- structured data
- random walk
- computational cost
- graph matching
- sparse coding
- weighted graph
- packing problem
- compressive sensing
- shortest path
- sparse matrix
- computational complexity
- image segmentation