检查
发表于 2025-4-1 05:13:25
http://reply.papertrans.cn/24/2348/234767/234767_61.png
cliche
发表于 2025-4-1 07:45:17
Maximum Upward Planar Subgraph of a Single-Source Embedded Digraphe this characterization to present an algorithm that computes a maximum upward planar single-source subgraph of a single-source embedded DAG. This algorithm takes .(..) time in the worst case and .(..) time on average.
absorbed
发表于 2025-4-1 12:40:07
http://reply.papertrans.cn/24/2348/234767/234767_63.png
新陈代谢
发表于 2025-4-1 18:03:30
Finding Maximum Edge Bicliques in Convex Bipartite Graphsm edge-cardinality biclique in convex bipartite graphs. Given a bipartite graph . = (., ., .) which is convex on ., we present a new algorithm that computes the maximum edge-cardinality biclique of . in .(. log.. loglog.) time and .(.) space, where . = |.|. This improves the current .(..) time bound available for the problem.