Finding a Longest Path in a Complete Multipartite Digraph
Work
Year: 1993
Type: article
Abstract: A digraph obtained by replacing each edge of a complete m-partite graph with an arc or a pair of mutually opposite arcs with the same end vertices is called a complete m-partite digraph. An $O ( n^3 )... more
Author Gregory Gutin
Institution Tel Aviv University
Cites: 4
Cited by: 45
Related to: 10
FWCI: 2.378
Citation percentile (by year/subfield): 94.61
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green