Titlebook: Algorithms and Computation; 4th International Sy K. W. Ng,P. Raghavan,F. Y. L. Chin Conference proceedings 1993 Springer-Verlag Berlin Heid

只看該作者 · 發(fā)表于 2025-3-28 19:57:52

Treewidth of circle graphs,ersection graph of a finite collection of chords of a circle. The TREEWIDTH problem can be viewed upon as the problem of finding a chordal embedding of the graph that minimizes the clique number. Our algorithm to determine the treewidth of a circle graph can be implemented to run in ..) time, where . is the number of vertices of the graph.

只看該作者 · 發(fā)表于 2025-3-28 23:52:24

Double-ended binomial queues,wing amortized time bounds: .(1) for ., and . operations, and .(logn) for ., arbitrary ., and . operations. An .-node d-b-queue can be constructed in 1.75. comparisons. Our results include a simple proof of .(1) amortized time merging for ordinary binomial queues.

只看該作者 · 發(fā)表于 2025-3-29 04:46:34

Adaptive and oblivious algorithms for d-cube permutation routing, 7 (called 7-cube). We also prove an ./log .) lower bound for the class of deterministic restricted oblivious permutation routing algorithms. Finally, we design optimal deterministic oblivious permutation routing on the .-cube, . ≤ 6.

只看該作者 · 發(fā)表于 2025-3-29 11:13:59

只看該作者 · 發(fā)表于 2025-3-29 14:25:27

https://doi.org/10.1007/3-540-57568-5AAC; Algorithms; Automat; DOM; algorithm; automata; complexity; computability; robot; robotics; combinatorics

只看該作者 · 發(fā)表于 2025-3-29 18:12:33

只看該作者 · 發(fā)表于 2025-3-29 22:51:09

只看該作者 · 發(fā)表于 2025-3-30 00:08:45

只看該作者 · 發(fā)表于 2025-3-30 06:39:33

		自動(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-17 19:20
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved