Pages that link to "Item:Q1924488"

The following pages link to Independence and port oracles for matroids, with an application to computational learning theory (Q1924488):

Displaying 12 items.

• Connected rigidity matroids and unique realizations of graphs (Q1775892) (← links)
• Complexity of packing common bases in matroids (Q2039228) (← links)
• Global rigidity of 2-dimensional direction-length frameworks with connected rigidity matroids (Q2104943) (← links)
• Global rigidity of periodic graphs under fixed-lattice representations (Q2221925) (← links)
• Matroid connectivity and singularities of configuration hypersurfaces (Q2224528) (← links)
• Global rigidity of generic frameworks on the cylinder (Q2338637) (← links)
• Sufficient conditions for the global rigidity of graphs (Q2347845) (← links)
• Combinatorial derived matroids (Q2699657) (← links)
• A generalization of Kruskal’s theorem on tensor decomposition (Q6043382) (← links)
• Color-avoiding connected spanning subgraphs with minimum number of edges (Q6130205) (← links)
• Ear‐decompositions, minimally connected matroids and rigid graphs (Q6144920) (← links)
• Matroid Intersection under Restricted Oracles (Q6161263) (← links)