Home
Digital Library
Site Map
Store
Contact Us
Press Room
Shopping Cart
Help
Login
Simple Search
Advanced Search
Author Search
Proceedings Search
CS Store Search
Google Search
Search Help
Search For:
Displaying 1-4 out of 4 total
Nonexistences of the Packing and Covering Designs for the Join Graph of K1 and C4 with a Pendent Edge
Found in:
2012 Fourth International Symposium on Information Science and Engineering (ISISE)
By Xiaoshan Liu,Qi Wang
Issue Date:December 2012
pp. 196-198
Let lKv be the complete multigraph with v vertices. A G -design G-GDl(v) of lKv is a pair (X,B), where X is the vertex set of Kv and B is a collection of subgraphs of Kv, called blocks, such that each block is isomorphic to and any two distinct vertices in...
2-Approximation Algorithms for Weighted Hypergraph Embedding in a Cycle Rings
Found in:
2012 Fourth International Symposium on Information Science and Engineering (ISISE)
By Xiaoshan Liu,Qi Wang
Issue Date:December 2012
pp. 193-195
A cycle rings is an undirected graph obtained from a cycle by replacing each edge of the cycle with a ring so that two rings corresponding to the two end-nodes of any edge have precisely one node in common. Given a weighted hyper graph on a cycle rings, Mi...
Minimum-Congestion Weighted Hypergraph Embedding in a Rings Cycle
Found in:
Computer Science and Information Engineering, World Congress on
By Qi Wang, Xiaoshan Liu, Xiaowei Zheng, Chunlin Li
Issue Date:April 2009
pp. 86-90
A rings cycle is an undirected graph obtained from a cycle by replacing each edge of the cycle with a ring so that two rings corresponding to the two end-nodes of any edge have precisely one node in common. Given a weighted hypergraph on a rings cycle, Min...
A 2-Approximation Algorithm for Weighted Directed Hypergraph Embedding in a cycle
Found in:
International Conference on Natural Computation
By Qi Wang, Xiuheng Zhao, Xiaowei Zheng, Xiaoshan Liu
Issue Date:October 2008
pp. 377-381
The problem of Weighted Directed Hypergraph Embedding in a Cycle (denoted by WDHEC for short) is to embed the weighted directed hyperedges of a hypergraph as the weighted directed paths around a cycle such that maximalcongestion-the sum of weight of the pa...
1
Original Search Engine
Need a Web Account?
For Members
For Non-members
Become a Member