On the complexity of list H-packing for sparse graph classes.
Tatsuya GimaTesshu HanakaYasuaki KobayashiYota OtachiTomohito ShiraiAkira SuzukiYuma TamuraXiao ZhouPublished in: CoRR (2023)
Keyphrases
- tractable cases
- worst case
- complexity measures
- directed acyclic
- random walk
- graph model
- computational complexity
- bounded treewidth
- equivalence classes
- graph representation
- bipartite graph
- connected components
- high dimensional
- data sets
- graph structure
- graph theory
- space complexity
- undirected graph
- structured data
- computational cost
- signal recovery
- sparse sampling