Testing whether a subgraph is convex or isometric
From MaRDI portal
Cites work
- A convexity lemma and expansion procedures for bipartite graphs
- A data structure for dynamic trees
- A new algorithm for optimal 2-constraint satisfaction and its implications
- A simple algorithm for multiple-source shortest paths in planar digraphs
- Algorithms for graphs of bounded treewidth via orthogonal range searching
- Computing the Inverse Geodesic Length in Planar Graphs and Graphs of Bounded Treewidth
- Convexities related to path properties on graphs
- Diameter, eccentricities and distance oracle computations on H-minor free graphs and graphs of bounded (distance) Vapnik-Chervonenkis dimension
- Distance-preserving subgraphs of hypercubes
- Factorization and pseudofactorization of weighted graphs
- Fast approximation algorithms for the diameter and radius of sparse graphs
- Fibonacci heaps and their uses in improved network optimization algorithms
- Geodesic Convexity in Graphs
- Graphs and cubes
- Graphs with connected medians
- Handbook of product graphs
- scientific article; zbMATH DE number 1339499 (Why is no real title available?)
- scientific article; zbMATH DE number 2119672 (Why is no real title available?)
- scientific article; zbMATH DE number 3342032 (Why is no real title available?)
- Isometric embedding in products of complete graphs
- Isometric Hamming embeddings of weighted graphs
- Isometric subgraphs of Hamming graphs and d-convexity
- Maintaining information in fully dynamic trees with top trees
- Maximizing dominance in the plane and its applications
- Median graphs and Helly hypergraphs
- Median Graphs and Triangle-Free Graphs
- Medians in median graphs and their cube complexes in linear time
- Metric graph theory and geometry: a survey
- Multiple-source shortest paths in embedded graphs
- Multiple-source shortest paths in planar graphs
- Multivariate analysis of orthogonal range searching and graph distances
- On finding convex cuts in general, bipartite and plane graphs
- On the complexity of k-SAT
- On the computation of the hull number of a graph
- Recognizing Cartesian products in linear time
- Subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs
- Subquadratic algorithms in minor-free digraphs: (weighted) distance oracles, decremental reachability, and more
- The structure of median graphs
- Undirected single-source shortest paths with positive integer weights in linear time
- VC set systems in minor-free (di)graphs and applications
- Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time
- Which problems have strongly exponential complexity?
This page was built for publication: Testing whether a subgraph is convex or isometric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312559)
