Sciweavers

1736 search results - page 28 / 348
» On antimagic directed graphs
Sort
View
CIE
2010
Springer
14 years 13 days ago
Spatial Models for Virtual Networks
This paper discusses the use of spatial graph models for the analysis of networks that do not have a direct spatial reality, such as web graphs, on-line social networks, or citatio...
Jeannette Janssen
EDBT
2010
ACM
138views Database» more  EDBT 2010»
14 years 13 days ago
How to authenticate graphs without leaking
Secure data sharing in multi-party environments requires that both authenticity and confidentiality of the data be assured. Digital signature schemes are commonly employed for au...
Ashish Kundu, Elisa Bertino
SIAMDM
2010
166views more  SIAMDM 2010»
13 years 6 months ago
Direct Product Factorization of Bipartite Graphs with Bipartition-reversing Involutions
Given a connected bipartite graph G, we describe a procedure which enumerates and computes all graphs H (if any) for which there is a direct product factorization G ∼= H × K2. W...
Ghidewon Abay-Asmerom, Richard Hammack, Craig E. L...
ALGORITHMICA
2000
85views more  ALGORITHMICA 2000»
13 years 7 months ago
An Algorithm for Enumerating All Spanning Trees of a Directed Graph
We present an O(NV +V 3) time algorithm for enumerating all spanning trees of a directed graph. This improves the previous best known bound of O(NE + V + E) [1] when V 2 = o(N), wh...
Sanjiv Kapoor, H. Ramesh
EDBT
2009
ACM
277views Database» more  EDBT 2009»
14 years 7 days ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...