Pages that link to "Item:Q2329655"

The following pages link to A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs (Q2329655):

Displaying 11 items.

• Component-cardinality-constrained critical node problem in graphs (Q299073) (← links)
• A linear time algorithm for finding all hinge vertices of a permutation graph (Q671396) (← links)
• Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem (Q1634769) (← links)
• EIA-CNDP: an exact iterative algorithm for critical node detection problem (Q2027003) (← links)
• Complexity of the multilevel critical node problem (Q2121476) (← links)
• Modeling the spread of infectious diseases through influence maximization (Q2136893) (← links)
• Acyclically pushable bipartite permutation digraphs: an algorithm (Q2497498) (← links)
• The connected critical node problem (Q2672625) (← links)
• A New Algorithm for Finding a Pseudoperipheral Node in a Graph (Q3474202) (← links)
• (Q4551374) (← links)
• Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items (Q6106591) (← links)