Pages that link to "Item:Q2827809"

The following pages link to Finding Paths in Grids with Forbidden Transitions (Q2827809):

Displaying 10 items.

• Separating codes and traffic monitoring (Q1704860) (← links)
• Domination problems with no conflicts (Q1752590) (← links)
• On the complexity of independent dominating set with obligations in graphs (Q2072059) (← links)
• Analyzing the reachability problem in choice networks (Q2170221) (← links)
• Codon optimization by 0-1 linear programming (Q2177826) (← links)
• The complexity of routing problems in forbidden-transition graphs and edge-colored graphs (Q2701383) (← links)
• Finding Paths in Grids with Forbidden Transitions (Q2827809) (← links)
• (Q6065468) (← links)
• Reachability in choice networks (Q6108917) (← links)
• On the routing problems in graphs with ordered forbidden transitions (Q6591488) (← links)