Pages that link to "Item:Q5897773"

The following pages link to FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science (Q5897773):

Displaying 11 items.

• The planar \(k\)-means problem is NP-hard (Q441888) (← links)
• Planar and grid graph reachability problems (Q733742) (← links)
• Backtracking problem in the traversal of an unknown directed graph by a finite robot (Q1774308) (← links)
• The isomorphism problem for planar 3-connected graphs is in unambiguous logspace (Q1959391) (← links)
• Deterministically isolating a perfect matching in bipartite planar graphs (Q1959397) (← links)
• (Q2766668) (← links)
• On the complexity of sandpile prediction problems (Q2811962) (← links)
• An $$O(n^{\epsilon })$$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs (Q3459899) (← links)
• The Planar k-Means Problem is NP-Hard (Q3605504) (← links)
• An <i>O</i> ( <i>n</i> ^ϵ ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs (Q4973896) (← links)
• Connectivity check in 3-connected planar graphs with obstacles (Q5300999) (← links)