Thinness and its variations on some graph families and coloring graphs of bounded thinness.
Flavia Bonomo-BrabermanEric BrandweinFabiano de S. OliveiraMoysés S. Sampaio Jr.Agustín SansoneJayme Luiz SzwarcfiterPublished in: CoRR (2023)
Keyphrases
- desirable characteristics
- graph representation
- graph matching
- graph theory
- directed graph
- weighted graph
- graph structure
- bounded treewidth
- graph mining
- graph databases
- graph construction
- graph structures
- labeled graphs
- graph model
- graph theoretic
- graph classification
- series parallel
- subgraph isomorphism
- undirected graph
- bounded degree
- adjacency matrix
- graph clustering
- graph theoretical
- graph partitioning
- random graphs
- dynamic graph
- graph data
- bipartite graph
- graph search
- graph representations
- graph kernels
- neighborhood graph
- connected graphs
- graph properties
- structural pattern recognition
- disk resident
- average degree
- inexact graph matching
- graph isomorphism
- minimum spanning tree
- random walk
- maximum common subgraph
- real world graphs
- directed acyclic
- maximum independent set
- spanning tree
- topological information
- planar graphs
- maximum clique
- structured data
- connected components
- web graph
- graph layout
- reachability queries
- frequent subgraphs
- graph transformation
- adjacency graph
- maximal cliques
- social graphs
- attributed relational graph
- dense subgraphs
- maximum cardinality
- finding the shortest path
- attributed graphs
- community detection
- association graph
- complex networks
- pattern mining
- graph edit distance
- graph embedding
- hyper graph
- small world
- graph drawing