Sciweavers

491 search results - page 27 / 99
» On cyclically orientable graphs
Sort
View
EDBT
2010
ACM
138views Database» more  EDBT 2010»
14 years 1 months 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
ACL
2009
13 years 6 months ago
Graph Ranking for Sentiment Transfer
With the aim to deal with sentiment-transfer problem, we proposed a novel approach, which integrates the sentiment orientations of documents into the graph-ranking algorithm. We a...
Qiong Wu, Songbo Tan, Xueqi Cheng
GC
2006
Springer
13 years 8 months ago
The Semi-Arc Automorphism Group of a Graph with Application to Map Enumeration
A map is a connected topological graph cellularly embedded in a surface. For a given graph , its genus distribution of rooted maps and embeddings on orientable and non-orientable s...
Linfan Mao, Yanpei Liu, Erling Wei
STOC
1991
ACM
105views Algorithms» more  STOC 1991»
13 years 12 months ago
An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs
act We give an algorithm for imbedding a graph G of n vertices onto an oriented surface of minimal genus g. If g > 0 then we also construct a forbidden subgraph of G which is ho...
Hristo Djidjev, John H. Reif
ICALP
2000
Springer
14 years 1 days ago
Formalizing the Development of Agent-Based Systems Using Graph Processes
Graph processes are used in order to formalize the relation between global requirement specifications of multi-agent systems by means of message sequence charts, and implementatio...
Ralph Depke, Reiko Heckel