On 2-Factors Splitting an Embedded Graph into Two Plane Graphs.
Gunnar BrinkmannSara ChiersCarol T. ZamfirescuPublished in: Graphs Comb. (2022)
Keyphrases
- graph representation
- graph theory
- graph structure
- graph matching
- graph construction
- weighted graph
- directed graph
- graph clustering
- adjacency matrix
- graph model
- labeled graphs
- graph mining
- graph databases
- graph theoretic
- random graphs
- graph structures
- graph data
- graph classification
- graph theoretical
- graph properties
- spanning tree
- undirected graph
- graph isomorphism
- subgraph isomorphism
- graph search
- graph representations
- graph partitioning
- series parallel
- dynamic graph
- graph patterns
- social graphs
- bipartite graph
- graph edit distance
- graph kernels
- graph transformation
- structural pattern recognition
- edge weights
- maximum clique
- connected graphs
- disk resident
- dense subgraphs
- connected dominating set
- planar graphs
- community discovery
- topological information
- reachability queries
- graph layout
- minimum spanning tree
- graph embedding
- inexact graph matching
- maximum common subgraph
- evolving graphs
- massive graphs
- maximal cliques
- proximity graph
- attributed graphs
- spectral decomposition
- structured data
- directed acyclic
- complex networks
- web graph
- graph drawing
- fully connected
- real world graphs
- association graph
- connected components
- small world
- densely connected
- polynomial time complexity
- quasi cliques
- frequent subgraphs
- random walk
- query graph
- social networks