Titlebook: Combinatorial Optimization and Applications; 5th International Co Weifan Wang,Xuding Zhu,Ding-Zhu Du Conference proceedings 2011 Springer-V

來(lái)自于

Hamiltonian Cycles through Prescribed Edges in ,-Ary ,-Cubes, . lies if, and only if, the subgraph of the .-ary .-cube induced by the edges of . is a vertex-disjoint collection of paths. This answers a question posed by Wang, Li and Wang who proved the analogous result for 3-ary .-cubes.

懶鬼才會(huì)衰弱

ORBIT

Public Communication Based on Russian Cards Protocol: A Case Study,ved Russian Cards protocol is presented. As a case study, .(6,31)(6 players and 31 cards) protocol is used to generate a common password for 5 parties who wish to access a shared file over the Internet.

預(yù)兆好

RAGE

On the Maximum Locally Clustered Subgraph and Some Related Problems,ansitivity in social networks. We give a polynomial time algorithm for one problem and show the NP-hardness of the other. For the NP-hard problem, we show some polynomial time solvable cases and give a 2-approximation algorithm for a restricted version. We also propose a heuristic algorithm for a more general version of the problem.

急急忙忙

Daily-Value

Weifan Wang,Xuding Zhu,Ding-Zhu DuState-of-the-art research.Fast-track conference proceedings.Unique visibility

FEMUR

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229978.jpg

ROOF

cochlea