Pages that link to "Item:Q1920444"

The following pages link to Maximum cycle-means of weighted digraphs (Q1920444):

Displaying 8 items.

• Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip (Q697566) (← links)
• The cost-to-time ratio problem for large or infinite graphs (Q1101357) (← links)
• An optimal algorithm for the period of a strongly connected digraph (Q1209368) (← links)
• Algorithms for finding the minimum cycle mean in the weighted directed graph (Q1279899) (← links)
• Strong regularity of matrices -- a survey of results (Q1314327) (← links)
• Approximating maximum weight cycle covers in directed graphs with weights zero and one (Q2483998) (← links)
• A numerical approach to long cycles in graphs and digraphs (Q5937935) (← links)
• A simplex-like method to compute the eigenvalue of an irreducible \((\max,+)\)-system (Q5940027) (← links)