Efficient algorithms under dynamic graphs to solve the Capacitated Arc Routing Problem with feasible sparse graph.
Sara TfailiHamdi DkhilAbdelkader SbihiAdnan YassinePublished in: RAIRO Oper. Res. (2019)
Keyphrases
- dynamic graph
- graph theory
- graph representation
- dynamic networks
- graph structure
- directed acyclic
- graph matching
- graph theoretic
- graph construction
- weighted graph
- gaussian graphical models
- directed graph
- graph model
- adjacency matrix
- graph theoretical
- graph partitioning
- graph mining
- labeled graphs
- graph structures
- graph classification
- graph databases
- graph search
- graph transformation
- graph clustering
- random graphs
- bipartite graph
- subgraph isomorphism
- connected dominating set
- minimum spanning tree
- series parallel
- undirected graph
- spanning tree
- densely connected
- graphical models
- graph embedding
- maximum common subgraph
- inexact graph matching
- sparse representation
- evolving graphs
- pattern mining
- structural pattern recognition
- dense subgraphs
- memetic algorithm
- feasible solution
- social graphs
- graph properties
- graph data
- graph kernels