Search results
From MaRDI portal
- Complexity of Finding a Sparse Wasserstein Barycenter 2019-10-16 Paper A Column Generation Approach to the Discrete Barycenter Problem 2019-07-02 Paper Power diagram...10 bytes (16 words) - 01:27, 11 December 2023
- numbers of acyclic families 2014-04-15 Paper Output-sensitive algorithm for the edge-width of an embedded graph 2014-04-03 Paper Finding shortest non-trivial...10 bytes (21 words) - 14:08, 10 December 2023
- Isotropic covariance functions on graphs and their edges 2020-12-14 Paper Discrete Wasserstein barycenters: optimal transport for discrete data 2016-11-29...10 bytes (18 words) - 14:51, 28 January 2024
- equations 2023-12-14 Paper Multisource Single-Cell Data Integration by MAW Barycenter for Gaussian Mixture Models 2023-10-30 Paper Nonexistence results of solutions...10 bytes (16 words) - 18:00, 9 December 2023
- cliques into paths to achieve planarity 2019-02-15 Paper The weighted barycenter drawing recognition problem 2019-02-15 Paper Gap-planar graphs 2018-09-24...10 bytes (16 words) - 19:22, 6 October 2023
- g‐vectors 2023-09-20 Paper Hopf dreams and diagonal harmonics 2023-08-22 Paper Edge connectivity of simplicial polytopes 2023-08-10 Paper The canonical complex...10 bytes (16 words) - 03:13, 25 September 2023
- de/entity/Q5054643 2022-11-29 Paper Statistical inference for Bures-Wasserstein barycenters 2021-11-04 Paper Efficient and positive semidefinite pre-averaging realized...10 bytes (18 words) - 20:57, 8 December 2023
- 2019-09-04 Paper Semi-algebraic sets of \(f\)-vectors 2019-08-12 Paper Barycenters of polytope skeleta and counterexamples to the topological Tverberg conjecture...10 bytes (19 words) - 01:05, 9 December 2023
- algebraic degree; bipyramid; point of tangency; realization space; edge barycenter; Koebe degree; point of minimal distance sum; Springborn degree; stacked...15 bytes (82 words) - 01:15, 2 February 2024
- 1080/00207169008803921 zbMATH Keywords graph drawing; hierarchical graphs; edge crossing; barycenter heuristic; greedy switching; median heuristics Mathematics Subject...15 bytes (143 words) - 22:41, 4 February 2024
- 1080/00207169008803941 zbMATH Keywords graph drawing; hierarchical graphs; edge crossing; barycenter heuristic; greedy switching; median heuristic Mathematics Subject...15 bytes (129 words) - 23:00, 3 February 2024
- zbMATH Keywords complexity theory; sparsity; optimal transport; Wasserstein barycenter; 3-dimensional matching Mathematics Subject Classification ID 68Q25: Analysis...15 bytes (98 words) - 19:38, 1 February 2024
- Journal in Brave) zbMATH Keywords volume; Hausdorff metric; lower bounds; barycenter; optimal estimates; smooth functionals; risk bounds; asymptotic orders...15 bytes (107 words) - 12:51, 31 January 2024
- New bounds on the barycenter heuristic for bipartite graph drawing., Embedding problems for paths with direction constrained edges., Incremental convex...15 bytes (344 words) - 07:41, 4 February 2024
- for Journal in Brave) zbMATH Keywords Graph drawing; Performance ratio; Barycenter heuristic Mathematics Subject Classification ID 68R10: Graph theory (including...15 bytes (114 words) - 12:10, 1 February 2024
- intersection representations, etc.) Cites Work Edge crossings in drawings of bipartite graphs New bounds on the barycenter heuristic for bipartite graph drawing...15 bytes (174 words) - 08:36, 1 February 2024
- planar graphs, A characterization of level planar graphs, New bounds on the barycenter heuristic for bipartite graph drawing. Cites Work Unnamed Item Unnamed...15 bytes (197 words) - 13:56, 31 January 2024
- number problems, Graph layout for applications in compiler construction, Edge crossings in drawings of bipartite graphs, Drawing graphs in two layers,...15 bytes (298 words) - 13:58, 4 February 2024
- zbMATH Keywords bipartite graph; median; directed graph; drawing algorithms; edge crossing Mathematics Subject Classification ID 68R10: Graph theory (including...15 bytes (229 words) - 13:14, 31 January 2024
- 05C50: Graphs and linear algebra (matrices, eigenvalues, etc.) Related Items Edge version of the matrix tree theorem for trees, On the Laplacian Eigenvalues...15 bytes (416 words) - 00:50, 6 February 2024
