Lower bounds for strictly fundamental cycle bases in grid graphs
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The zoo of tree spanner problemsDiscrete Applied Mathematics, 2008
- New length bounds for cycle basesInformation Processing Letters, 2007
- Classes of cycle basesDiscrete Applied Mathematics, 2007
- Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases2005
- A Graph-Theoretic Game and Its Application to the k-Server ProblemSIAM Journal on Computing, 1995
- Graph minors. V. Excluding a planar graphJournal of Combinatorial Theory, Series B, 1986
- Algorithms for Generating Fundamental Cycles in a GraphACM Transactions on Mathematical Software, 1982
- An algorithm for finding a fundamental set of cycles of a graphCommunications of the ACM, 1969
- Algorithms for finding a fundamental set of cycles for an undirected linear graphCommunications of the ACM, 1967
- On the Abstract Properties of Linear DependenceAmerican Journal of Mathematics, 1935