Revision as of 10:33, 22 October 2021 edit Maggyero (talk \| contribs) Extended confirmed users 4,481 edits No edit summary ← Previous edit		Revision as of 18:56, 23 September 2022 edit undo Ais523 (talk \| contribs) Extended confirmed users 12,379 edits m →Kameda's Algorithm: fix broken link to section Next edit →
Line 126: \| year = 1975 \| doi=10.1016/0020-0190(75)90019-8}}.</ref> can be used if the graph is [[Planar graph\|planar]], [[Directed acyclic graph\|acyclic]], and also exhibits the following additional properties: all 0-[[Directed graph#Indegree and outdegree\|indegree]] and all 0-[[Directed graph#Indegree and outdegree\|outdegree]] vertices appear on the same [[Glossary of graph theory#~~Genus~~face\|face]] (often assumed to be the outer face), and it is possible to partition the boundary of that face into two parts such that all 0-indegree vertices appear on one part, and all 0-outdegree vertices appear on the other (i.e. the two types of vertices do not alternate).

Reachability: Difference between revisions