On non-superperfection of edge intersection graphs of paths.
Victoria KaialHervé KerivinAnnegret Katrin WaglerPublished in: Discret. Optim. (2024)
Keyphrases
- weighted graph
- disjoint paths
- undirected graph
- shortest path
- edge weights
- minimum spanning trees
- graph theory
- edge detection
- directed graph
- intersection points
- adjacency graph
- graph databases
- graph matching
- graph mining
- graph theoretic
- structured objects
- approximation algorithms
- complex structures
- graph partitioning
- pattern recognition
- graph clustering
- labeled graphs
- series parallel
- data sets
- image processing
- scale space
- vertex set
- random graphs
- multiple scales
- data objects
- spanning tree
- edge information