Graphs as navigational infrastructure for high dimensional data spaces
From MaRDI portal
Publication:2513376
DOI10.1007/s00180-011-0228-6zbMath1304.65041OpenAlexW2092929535MaRDI QIDQ2513376
Publication date: 28 January 2015
Published in: Computational Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00180-011-0228-6
Hamiltoniansgraph productsline graphsEuler toursKneser graphdata visualizationHamiltonian decompositionshigh dimensional space2d tours3d transition graph4d transition graphscatterplot matricesspace graphsvariable graphs
Related Items
Special issue: Data viz VI, Eulerian tour algorithms for data visualization and the \({{\mathtt PairViz}}\) package
Uses Software
Cites Work
- Statistical analysis of network data. Methods and models
- Associative products of graphs
- Kneser graphs are Hamiltonian for \(n\geq 3k\)
- Hamilton cycle decomposition of line graphs and a conjecture of Bermond
- Eulerian tour algorithms for data visualization and the \({{\mathtt PairViz}}\) package
- Parallel Coordinates
- Estimating Optimal Transformations for Multiple Regression and Correlation
- A Construction of a perfect set of Euler tours of K2k+1
- Handbook of Graph Theory
- Hamilton decompositions of some line graphs
- Cycle systems of the line graph of the complete graph
- The existence of complete cycles in repeated line-graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
