Vertex deletion into bipartite permutation graphs.
Lukasz BozykJan DerbiszTomasz KrawczykJana NovotnáKarolina OkrasaPublished in: CoRR (2020)
Keyphrases
- undirected graph
- vertex set
- bipartite graph
- directed graph
- maximum cardinality
- graph model
- edge weights
- graph partitioning
- labeled graphs
- minimum weight
- attributed graphs
- spanning tree
- approximation algorithms
- minimum cost
- complex networks
- graph matching
- connected subgraphs
- hamiltonian cycle
- graph structure
- adjacency matrix
- connected components
- weighted graph
- data mining
- graph representation
- real valued
- directed acyclic graph
- connected graphs
- graph structures
- graph theoretic
- bayesian networks
- subgraph isomorphism
- random graphs
- graph clustering
- pairwise