The even‐path problem for graphs and digraphs

doi:10.1002/net.3230140403

The even‐path problem for graphs and digraphs

2006-10-11

0

PRE

AI

DOI：10.1002/net.3230140403

原文链接

原文求助

摘要

En 中文

AbstractWe give a simple linear‐time algorithm for finding even‐length simple paths between two specified nodes of a given graph. We show that the same problem for directed graphs is NP‐complete.

The even‐path problem for graphs and digraphs

摘要

期刊

机构

引用论文