Pages that link to "Item:Q3769979"
From MaRDI portal
The following pages link to A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph (Q3769979):
Displaying 50 items.
- Minimum strictly fundamental cycle bases of planar graphs are hard to find (Q266952) (← links)
- The cycle's structure of embedded graphs in surfaces (Q277096) (← links)
- Cycle-based cluster variational method for direct and inverse inference (Q330619) (← links)
- Structural stability and jamming of self-organized cluster conformations in dense granular materials (Q361305) (← links)
- Counting 2-connected deletion-minors of binary matroids (Q385399) (← links)
- Testing connectivity of faulty networks in sublinear time (Q450565) (← links)
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- Certifying algorithms (Q465678) (← links)
- Characterization of minimum cycle basis in weighted partial 2-trees (Q491600) (← links)
- On the approximability of the minimum strictly fundamental cycle basis problem (Q629358) (← links)
- New approximation algorithms for minimum cycle bases of graphs (Q633843) (← links)
- On the complexity of matroid isomorphism problem (Q639843) (← links)
- Finding a shortest cycle in a subspace of the cycle space of a graph (Q668125) (← links)
- Modeling the dynamics of complex multibody systems with kinematical transmission elements (Q687443) (← links)
- Properties of Gomory-Hu co-cycle bases (Q764362) (← links)
- Computing sharp recovery structures for locally recoverable codes (Q782862) (← links)
- Minimum cycle bases of direct products of complete graphs (Q846010) (← links)
- Short cycle structures for graphs on surfaces and an open problem of Mohar and Thomassen (Q854646) (← links)
- Classes of cycle bases (Q868389) (← links)
- Algorithms for shortest paths and \(d\)-cycle problems (Q876687) (← links)
- Short cycle structure of graphs on surfaces. I: The uniqueness theorems (Q950676) (← links)
- Minimum cut bases in undirected networks (Q968141) (← links)
- Efficient approximation algorithms for shortest cycles in undirected graphs (Q987804) (← links)
- An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs (Q1006382) (← links)
- Integral cycle bases for cyclic timetabling (Q1013300) (← links)
- Edge-swapping algorithms for the minimum fundamental cycle basis problem (Q1014301) (← links)
- Minimum weakly fundamental cycle bases are hard to find (Q1024786) (← links)
- On finding cycle bases and fundamental cycle bases with a shortest maximal cycle (Q1029002) (← links)
- Minor and minimum cycle bases of a 3-connected planar graph (Q1034289) (← links)
- A greedy approach to compute a minimum cycle basis of a directed graph (Q1041731) (← links)
- Sparse null basis computations in structural optimization (Q1115103) (← links)
- A redundancy eliminating approach to linearly independent rings selection in the ring perception problem (Q1348047) (← links)
- On finding a cycle basis with a shortest maximal cycle (Q1349748) (← links)
- On the automation of the force method in the optimal plastic design of frames (Q1371760) (← links)
- Length bounds for cycle bases of graphs (Q1625491) (← links)
- Minimum cycle bases of weighted outerplanar graphs (Q1675771) (← links)
- On the role of differential adhesion in gangliogenesis in the enteric nervous system (Q1786426) (← links)
- The Steinberg module of a graph (Q1825879) (← links)
- Generating cycle spaces for graphs on surfaces with small genera (Q1883618) (← links)
- A cycle-based formulation for the distance geometry problem (Q2056892) (← links)
- Cycle analysis of directed acyclic graphs (Q2128678) (← links)
- A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block (Q2159428) (← links)
- Minimum cycle basis of direct product of \(K_2 \times K_n\) (Q2250957) (← links)
- New length bounds for cycle bases (Q2380021) (← links)
- Building stable chains with motile agents: insights into the morphology of enteric neural crest cell migration (Q2413854) (← links)
- Minimum cycle bases of graphs on surfaces (Q2461194) (← links)
- The zoo of tree spanner problems (Q2476246) (← links)
- Minimum spanning tree cycle intersection problem (Q2656964) (← links)
- Approximate inverse Ising models close to a Bethe reference point (Q3301698) (← links)
- On the Complexity of Matroid Isomorphism Problems (Q3392964) (← links)
