Self-orthogonal decompositions of graphs into matchings.
Sven HartmannUwe LeckPublished in: Electron. Notes Discret. Math. (2005)
Keyphrases
- maximum cardinality
- bipartite graph
- graph theoretic
- series parallel
- graph structure
- graph theory
- information systems
- graph clustering
- graph representation
- graph matching
- singular value decomposition
- weighted graph
- graph mining
- graph databases
- graph partitioning
- relational databases
- object recognition
- graph construction
- subgraph isomorphism
- case study
- minimum weight
- structured objects
- database