Convertible subspaces that arise from different numberings of the vertices of a graph.
Henrique F. da CruzIlda Inácio RodriguesRogério Pedro SerôdioPublished in: Ars Math. Contemp. (2019)
Keyphrases
- weighted graph
- adjacency matrix
- labeled graphs
- undirected graph
- hamiltonian cycle
- random graphs
- edge weights
- average degree
- vertex set
- graph model
- planar graphs
- graph structure
- attributed graphs
- maximum matching
- directed edges
- bipartite graph
- graph partitioning
- maximal cliques
- directed acyclic graph
- connected subgraphs
- graph representation
- minimum weight
- maximum cardinality
- graph theoretic
- connected components
- high dimensional data
- graph matching
- data sets
- graph theory
- directed graph
- query graph
- random walk
- low dimensional
- logic programs
- principal component analysis
- feature space