Pages that link to "Item:Q1044711"

The following pages link to The labeled perfect matching in bipartite graphs (Q1044711):

Displaying 21 items.

• Traveling salesman problems in temporal graphs (Q284573) (← links)
• The label cut problem with respect to path length and label frequency (Q313969) (← links)
• A note on the clustered set covering problem (Q496643) (← links)
• The maximum labeled path problem (Q527429) (← links)
• Approximation and hardness results for label cut and related problems (Q630189) (← links)
• On complexity of special maximum matchings constructing (Q952636) (← links)
• The labeled maximum matching problem (Q1000970) (← links)
• Secluded connectivity problems (Q1679225) (← links)
• Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem (Q1702134) (← links)
• Labeled traveling salesman problems: complexity and approximation (Q1952507) (← links)
• The parameterized complexity of some minimum label problems (Q1959420) (← links)
• Minimum label \(s\)-\(t\) cut has large integrality gaps (Q2216106) (← links)
• Graph matching problems and the NP-hardness of sortedness constraints (Q2402671) (← links)
• Bi-criteria and approximation algorithms for restricted matchings (Q2453169) (← links)
• An Introduction to Temporal Graphs: An Algorithmic Perspective (Q3464477) (← links)
• The Complexity of Bottleneck Labeled Graph Problems (Q3508579) (← links)
• A note on the hardness results for the labeled perfect matching problems in bipartite graphs (Q3598040) (← links)
• An Introduction to Temporal Graphs: An Algorithmic Perspective^* (Q5856438) (← links)
• Maximum cuts in edge-colored graphs (Q5918845) (← links)
• The complexity of bottleneck labeled graph problems (Q5961969) (← links)
• Minimum <scp>color‐degree</scp> perfect <i>b</i>‐matchings (Q6087129) (← links)