Sciweavers

2503 search results - page 142 / 501
» A study of 3-arc graphs
Sort
View
GLOBECOM
2007
IEEE
16 years 26 days ago
On the (in)Effectiveness of Probabilistic Marking for IP Traceback Under DDoS Attacks
—Distributed denial-of-service attacks (DDoS) pose an immense threat to the Internet. The most studied solution is to let routers probabilistically mark packets with partial path...
Vamsi Paruchuri, Arjan Durresi, Raj Jain
PODS
2010
ACM
213views Database» more  PODS 2010»
15 years 11 months ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...
TGIS
2002
103views more  TGIS 2002»
15 years 6 months ago
Integration of Space Syntax into GIS: New Perspectives for Urban Morphology
Although space syntax has been successfully applied to many urban GIS studies, there is still a need to develop robust algorithms that support the automated derivation of graph re...
Bin Jiang, Christophe Claramunt
CORR
2008
Springer
131views Education» more  CORR 2008»
15 years 6 months ago
Towards a More Accurate Carrier Sensing Model for CSMA Wireless Networks
Abstract--In the majority of studies on CSMA wireless networks, a contention graph is used to model the carrier sensing relationships among links. This is a 0-1 model in which two ...
Caihong Kai, Soung Chang Liew
CIAC
1997
Springer
154views Algorithms» more  CIAC 1997»
15 years 10 months ago
Isomorphism for Graphs of Bounded Distance Width
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...
Koichi Yamazaki, Hans L. Bodlaender, Babette de Fl...