Interval-based graph representations for efficient web querying. Diplomarbeit/diploma thesis, Ludwig-Maxmilians University Munich (2009) 2 Labeling RDF Graphs for Linear Time and Space Querying
by
Antonius Weinzierl
,
Beginn Der Arbeit
,
Prof Dr
,
François Bry
,
Dr. Tim Furche
,
Dr. Norbert
,
Eisinger Erklärung
,
München Den
,
Antonius Weinzierl Zusammenfassung
| Citations: | 1 - 1 self |
BibTeX
@MISC{Weinzierl_interval-basedgraph,
author = {Antonius Weinzierl and Beginn Der Arbeit and Prof Dr and François Bry and Dr. Tim Furche and Dr. Norbert and Eisinger Erklärung and München Den and Antonius Weinzierl Zusammenfassung},
title = {Interval-based graph representations for efficient web querying. Diplomarbeit/diploma thesis, Ludwig-Maxmilians University Munich (2009) 2 Labeling RDF Graphs for Linear Time and Space Querying},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Hiermit versichere ich, dass ich diese Diplomarbeit selbständig verfasst habe. Ich habe dazu keine anderen als die angegebenen Quellen und Hilfsmittel verwendet.
Citations
| 34 | A special planar satisfiability problem and a consequence of its NP-completeness - Kratochvíl - 1994 |
| 16 | A new planarity test - Shih, Hsu - 1999 |
| 15 | Polynomial complete consecutive information retrieval problems - Kou - 1977 |
| 11 | Recognizing interval digraphs and interval bigraphs in polynomial time - Müller - 1997 |
| 7 | PC-Trees vs. PQ-Trees - Hsu |
| 5 | Classes of interval digraphs and 0,1-matrices - Lin, Sen, et al. |
| 1 | Two NP-complete problems related to information retrieval - Lipski - 1977 |
| 1 | Matrices with the consecutive ones property, interval graphs and their applications - Osmani - 2001 |
