Pages that link to "Item:Q458496"

The following pages link to Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496):

Displaying 50 items.

• Minimum strictly fundamental cycle bases of planar graphs are hard to find (Q266952) (← links)
• Stratified sampling for the Ising model: A graph-theoretic approach (Q311816) (← links)
• Cycle-based cluster variational method for direct and inverse inference (Q330619) (← links)
• Certifying algorithms (Q465678) (← links)
• Characterization of minimum cycle basis in weighted partial 2-trees (Q491600) (← links)
• Algebraic and topological indices of molecular pathway networks in human cancers (Q745139) (← links)
• Properties of Gomory-Hu co-cycle bases (Q764362) (← links)
• Classes of cycle bases (Q868389) (← links)
• Cycle bases from orderings and coverings (Q1182973) (← links)
• Minimum cycle bases of weighted outerplanar graphs (Q1675771) (← links)
• Construction of a topological drawing of the most planar subgraph of the non-planar graph (Q1792535) (← links)
• Interchangeability of relevant cycles in graphs (Q1972676) (← links)
• Acyclic digraphs giving rise to complete intersections (Q2002592) (← links)
• A cycle-based formulation for the distance geometry problem (Q2056892) (← links)
• The distance orientation problem (Q2091816) (← links)
• A characterization of circle graphs in terms of total unimodularity (Q2122669) (← links)
• Cycle analysis of directed acyclic graphs (Q2128678) (← links)
• How to minimize cycle times of robot manufacturing systems (Q2139147) (← links)
• Games, graphs and Kirchhoff laws (Q2157180) (← links)
• Synchronization problems in computer vision with closed-form solutions (Q2193841) (← links)
• The lattice of cycles of an undirected graph (Q2228498) (← links)
• Minimum cycle basis of direct product of \(K_2 \times K_n\) (Q2250957) (← links)
• On minimum average stretch spanning trees in polygonal 2-trees (Q2339451) (← links)
• Characterising planar Cayley graphs and Cayley complexes in terms of group presentations (Q2441636) (← links)
• A computer approach to overtaking station track layout diagram design using graphs. An alternative track diagram proposal for these stations (Q2656109) (← links)
• Minimum spanning tree cycle intersection problem (Q2656964) (← links)
• Derivation and generation of path-based valid inequalities for transmission expansion planning (Q2673816) (← links)
• A cycle-based formulation and valid inequalities for DC power transmission problems with switching (Q2830766) (← links)
• Convex cycle bases (Q3191452) (← links)
• Rooted Cycle Bases (Q3449832) (← links)
• Sensor Network Localization on the Group of Three-Dimensional Displacements (Q3457100) (← links)
• Is every cycle basis fundamental? (Q3476832) (← links)
• Flow and Elastic Networks on the 𝑛-Torus: Geometry, Analysis, and Computation (Q5025736) (← links)
• A Family of Tree-Based Generators for Bubbles in Directed Graphs (Q5041176) (← links)
• A family of tree-based generators for bubbles in directed graphs (Q5084695) (← links)
• Periodic Event Scheduling for Automated Production Systems (Q5086025) (← links)
• EVOLUTIONARILY-FRAGMENTED ALGORITHM FOR FINDING A MAXIMAL FLAT PART OF A GRAPH (Q5150702) (← links)
• PLANARITY TESTING AND CONSTRUCTING THE TOPOLOGICAL DRAWING OF A PLANE GRAPH (DFS) (Q5150740) (← links)
• A Posteriori Error Estimates for Multilevel Methods for Graph Laplacians (Q5161767) (← links)
• INDEPENDENT AND IRREDUNDANT CYCLE TRACKING SETS OF A GRAPH: AN EFFICIENT APPROACH TO ELECTRICAL CIRCUIT ANALYSIS (Q5237593) (← links)
• Cycle bases of reduced powers of graphs (Q5357298) (← links)
• (Q5466091) (← links)
• (Q5743440) (← links)
• On bubble generators in directed graphs (Q5919462) (← links)
• \(L(p,q)\)-labeling and integer tension of a graph embedded on torus (Q5963610) (← links)
• Cycle-based formulations in distance geometry (Q6114894) (← links)
• Forward and line-based cycle bases for periodic timetabling (Q6168361) (← links)
• Economic genome assembly from low coverage illumina and nanopore data (Q6487638) (← links)
• Adaptive quadratures for nonlinear approximation of low-dimensional PDEs using smooth neural networks (Q6494202) (← links)
• Computing cyclic invariants for molecular graphs (Q6496347) (← links)