


default search action
Theoretical Computer Science, Volume 767
Volume 767, May 2019
- Yuxing Yang

, Jing Li, Shiying Wang:
Embedding fault-free hamiltonian paths with prescribed linear forests into faulty ternary n-cubes. 1-15 - Yuzhi Xiao, Haixing Zhao, Yaping Mao

, Guanrong Chen:
Invulnerability of planar two-tree networks. 16-25 - Khaled M. Elbassioni

, Imran Rauf, Saurabh Ray:
A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs. 26-33 - Zhen Zhang

, Shuqiang Huang, Dong Guo, Yonghui Li:
RVCCC: A new variational network of cube-connected cycles and its topological properties. 34-50 - Peng Jiang

, Fuchun Guo
, Yi Mu:
Efficient identity-based broadcast encryption with keyword search against insider attacks for database systems. 51-72 - Pratik Ghosal

, Meghana Nasre, Prajakta Nimbhorkar
:
Rank-maximal matchings - structure and algorithms. 73-82 - Olivier Hudry, Antoine Lobstein

:
Unique (optimal) solutions: Complexity results for identifying and locating-dominating codes. 83-102

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














