Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic Bounds.
K. CirinoS. MuthukrishnanN. S. NarayanaswamyH. RameshPublished in: FSTTCS (1997)
Keyphrases
- graph model
- bipartite graph
- graph partitioning
- undirected graph
- graph representation
- weighted graph
- graph structure
- directed graph
- adjacency matrix
- graph matching
- labeled graphs
- graph theory
- graph theoretic
- edge weights
- graph clustering
- graph structures
- graph databases
- vertex set
- graph classification
- maximum cardinality
- subgraph isomorphism
- random graphs
- series parallel
- graph construction
- graph mining
- graph theoretical
- graph representations
- adjacency graph
- graph data
- upper bound
- graph kernels
- real world graphs
- maximum common subgraph
- spanning tree
- graph search
- structural pattern recognition
- directed acyclic graph
- dense subgraphs
- graph properties
- random walk
- web graph
- finding the shortest path
- attributed graphs
- maximal cliques
- evolving graphs
- structured data
- graph transformation
- graph isomorphism
- lower bound
- reachability queries
- graph layout
- worst case
- connected graphs
- dynamic graph
- graph drawing
- graphical models
- query graph
- link prediction
- community detection
- topological information
- minimum spanning tree
- community discovery