default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 119
Volume 119, March 2017
- Mostafa Haghir Chehreghani
, Talel Abdessalem:
Upper and lower bounds for the q-entropy of network models with application to network model selection. 1-8 - Zhao Zhang, Xiaoting Li, Yishuo Shi, Hongmei Nie, Yuqing Zhu:
PTAS for minimum k-path vertex cover in ball graph. 9-13 - Zepeng Li, Jin Xu:
A characterization of trees with equal independent domination and secure domination numbers. 14-18 - Junhu Wang, Jeffrey Xu Yu, Jixue Liu, Chaoyi Pang:
A revised result on chasing tree patterns under schema graphs. 19-24 - Satyanarayana Vollala, Natarajan Ramasubramanian:
Energy efficient modular exponentiation for public-key cryptography based on bit forwarding techniques. 25-38 - Rundan Xing, Bo Zhou:
On the two largest distance eigenvalues of graph powers. 39-43
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.
last updated on 2026-02-06 22:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
