Sciweavers

677 search results - page 63 / 136
» Bipartite roots of graphs
Sort
View
ISAAC
2005
Springer
153views Algorithms» more  ISAAC 2005»
14 years 4 months ago
Network Game with Attacker and Protector Entities
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...
WWW
2004
ACM
14 years 11 months ago
Semantic api matching for automatic service composition
In this paper, we address the problem of matching I/O descriptions of services to enable their automatic service composition. Specifically, we develop a method of semantic schema ...
Doina Caragea, Tanveer Fathima Syeda-Mahmood
COMBINATORICS
2007
87views more  COMBINATORICS 2007»
13 years 11 months ago
Bartholdi Zeta Functions for Hypergraphs
Recently, Storm [8] defined the Ihara-Selberg zeta function of a hypergraph, and gave two determinant expressions of it. We define the Bartholdi zeta function of a hypergraph, a...
Iwao Sato
COCOON
2009
Springer
14 years 5 months ago
Edge-Intersection Graphs of k-Bend Paths in Grids
Edge-intersection graphs of paths in grids are graphs that can be represented with vertices as paths in grids and edges between the vertices of the graph exist whenever two grid pa...
Therese C. Biedl, Michal Stern
DCC
2008
IEEE
14 years 5 months ago
Adaptive Compression of Graph Structured Text
In this paper we introduce an adaptive technique for compressing small quantities of text which are organized as a rooted directed graph. We impose a constraint on the technique s...
John Gilbert, David M. Abrahamson