A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
We present HyperGraphDB, a novel graph database based on generalized hypergraphs where hyperedges can contain other hyperedges. This generalization automatically reifies every ent...
In recent years World Wide Web traffic has shown phenomenal growth. The main causes are the continuing increase in the number of people navigating the Internet and the creation of ...
Cristina Hava Muntean, Jennifer McManis, John Murp...
: Web usage mining has been much concentrated on the discovery of relevant user behaviours from Web access record data. In this paper, we present WebUser, an approach to discover u...