Titlebook: Computing and Combinatorics; 16th Annual Internat My T. Thai,Sartaj Sahni Conference proceedings 2010 Springer-Verlag Berlin Heidelberg 201

只看該作者 · 發(fā)表于 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.

只看該作者 · 發(fā)表于 2025-4-1 12:40:07

只看該作者 · 發(fā)表于 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.

		自動(dòng)登錄	找回密碼
密碼			To register

關(guān)于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務(wù)流程	影響因子官網(wǎng)	吾愛論文網(wǎng)	大講堂	北京大學(xué)	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點(diǎn)評(píng)	投稿經(jīng)驗(yàn)總結(jié)	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學(xué)	Yale Uni.	Stanford Uni.
\|Archiver\|手機(jī)版\|小黑屋\| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-12 00:39
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved