About groups of straight lines
From MaRDI portal
Cited in
(21)- Partial order multiway search
- A new linear-time algorithm for centroid decomposition
- Proximity and remoteness in graphs: a survey
- On approximate colored path counting
- The weight balance function on trees
- Extremal graphs with respect to the total-eccentricity index
- Medians in median graphs and their cube complexes in linear time
- Partitions and automorphisms of finite Kurepa trees
- A note on elementarity of virtual dendro-morphisms for higher rank lattices
- Invariants of binomial edge ideals via linear programs
- Faster path queries in colored trees via sparse matrix multiplication and min-plus product
- Small additive error for unsplittable multicommodity flow in outerplanar graphs
- Plurality in spatial voting games with constant
- Minimising the eccentricity index in trees with given segment sequence
- Extremal problems on Steiner k-distances
- Simultaneous separation in bounded degree trees
- Polylogarithmic time algorithms for shortest path forests in programmable matter
- Approximation of spanning tree congestion using hereditary bisection
- Subgraph-universal planar graphs for trees
- Centrality in connected graphs via convexity or concavity
- Property testing in Gaussian graphical models: trees and small separation numbers
This page was built for publication: About groups of straight lines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1564864)
