Efficient algorithms for supergraph query processing on graph databases
Year of publication: |
2011
|
---|---|
Authors: | Zhang, Shuoxun ; Gao, Xiaofeng ; Wu, Weili ; Li, Jianzhong ; Gao, Hongyan |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 21.2011, 2, p. 159-191
|
Subject: | Datenbank | Database | Graphentheorie | Graph theory | Algorithmus | Algorithm |
-
Automated generation of personal data reports from relational databases
Fakas, Georgios John, (2011)
-
Design and development of algorithms for identifying termination of triggers in active databases
Chezian, R. Manicka, (2011)
-
Materynska, Sofiia, (2022)
- More ...
-
A PTAS for minimum connected dominating set in 3-dimensional Wireless sensor networks
Zhang, Zhao, (2009)
-
A PTAS for minimum d-hop connected dominating set in growth-bounded graphs
Gao, Xiaofeng, (2010)
-
Wireless networking, dominating and packing
Wu, Weili, (2010)
- More ...