Search results
From MaRDI portal
- Date of Publication Type A column generation approach to the discrete barycenter problem 2023-03-29 Paper Circuit walks in integral polyhedra 2022-06-09...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 (114 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 (113 words) - 23:00, 3 February 2024
- hard., Tutte's barycenter method applied to isotopies, The symmetry number problem for trees, A force-directed algorithm that preserves edge-crossing properties...15 bytes (207 words) - 07:41, 4 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 (103 words) - 12:51, 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 (191 words) - 13:58, 4 February 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 (222 words) - 00:50, 6 February 2024
- of the domination number for random class cover catch digraphs, Tutte's barycenter method applied to isotopies, An application of Ramsey theorem to stopping...15 bytes (261 words) - 02:44, 7 February 2024
- structure of quasi 4-connected graphs, Tutte's barycenter method applied to isotopies, Contractible non-edges in \(3\)-connected graphs, Contractible subgraphs...15 bytes (103 words) - 23:29, 5 February 2024
- cubical complexes, Tutte's barycenter method applied to isotopies, A type-B associahedron., Canonical modules of certain edge subrings, Higher Lawrence...15 bytes (809 words) - 22:03, 6 February 2024
- Efficient partition trees, Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs, Upper envelope onion...15 bytes (2,400 words) - 13:38, 5 February 2024
