-apices of minor-closed graph classes. I. Bounding the obstructions.
Ignasi SauGiannos StamoulisDimitrios M. ThilikosPublished in: J. Comb. Theory, Ser. B (2023)
Keyphrases
- graph theory
- random walk
- equivalence classes
- directed graph
- graph structure
- graph based algorithm
- queueing networks
- graph representation
- graph model
- directed acyclic graph
- bipartite graph
- structured data
- graph matching
- graph partitioning
- graphical models
- social networks
- weighted graph
- connected components
- knn
- search algorithm