Hypergraph traversal revisited: cost measures and dynamic algorithms
From Semantic Portal Wiki
{{#vardefine:category|Publication}}{{#vardefine:templatename|i.publication}}{{#vardefine:package|smwbp_instance_templates}}
| Edit |
Reference: {{#vardefine:pagename|hypergraph traversal revisited: cost measures and dynamic algorithms }}
- [[]]
bibtex
{{#vardefine:pagename|Hypergraph traversal revisited: cost measures and dynamic algorithms }}{{#vardefine:key| }}
abstract:
download:
- paper:
- slides:
Facts about Hypergraph traversal revisited: cost measures and dynamic algorithmsRDF feed
| Address | London, UK + |
| Author | Giorgio Ausiello +, Giuseppe F. Italiano +, and Umberto Nanni + |
| Bibtype | inproceedings + |
| Booktitle | MFCS '98: Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science + |
| Key | 667368 + |
| Pages | 1--16 + |
| Publisher | Springer-Verlag + |
| Relation | AND/OR graph + |
| Tag | Computer science + |
| Title | Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms + |
| Year | 1998 + |
