2021年12月11日
小札 Maximum Weight Closure of a Graph
摘要： 1. Introduction Define a closure of a directed graph \(G=(V,E)\) as an induced set of vertexes of \(G\), where the out-tended edges in \(E\) start at 阅读全文
posted @ 2021-12-11 14:13 cirnovsky 阅读(63) 评论(0) 推荐(0)