Anti-Path Cover on Sparse Graph Classes.
Pavel DvorákDusan KnopTomás MasaríkPublished in: MEMICS (2016)
Keyphrases
- directed acyclic
- random walk
- equivalence classes
- sparse data
- graph theory
- graph structure
- graph theoretic
- graph representation
- solution path
- high dimensional
- strongly connected
- shortest path
- gaussian graphical models
- weighted graph
- minimum cost
- sparse matrix
- graph mining
- link analysis
- finding the shortest path
- graph matching
- sparse representation
- neural network
- hamiltonian path
- elastic net
- security protection
- adjacency matrix
- graph laplacian
- graph construction
- edge weights
- undirected graph
- spanning tree
- directed acyclic graph
- endpoints
- structured data
- graphical models