Sciweavers

1756 search results - page 120 / 352
» Directed scale-free graphs
Sort
View
IJCAI
2007
13 years 9 months ago
A Factor Graph Model for Software Bug Finding
Automatic tools for finding software errors require knowledge of the rules a program must obey, or “specifications,” before they can identify bugs. We present a method that ...
Ted Kremenek, Andrew Y. Ng, Dawson R. Engler
DM
2008
75views more  DM 2008»
13 years 8 months ago
Homogeneous factorisations of graph products
A homogeneous factorisation of a digraph consists of a partition P = {P1, . . . , Pk} of the arc set A and two vertex-transitive subgroups M G Aut() such that M fixes each Pi set...
Michael Giudici, Cai Heng Li, Primoz Potocnik, Che...
COR
2006
94views more  COR 2006»
13 years 8 months ago
A comparison of two different formulations for arc routing problems on mixed graphs
Arc Routing Problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing ...
Angel Corberán, Enrique Mota, José M...
COMBINATORICA
2007
81views more  COMBINATORICA 2007»
13 years 8 months ago
Total domination of graphs and small transversals of hypergraphs
The main result of this paper is that every 4-uniform hypergraph on n vertices and m edges has a transversal with no more than (5n + 4m)/21 vertices. In the particular case n = m,...
Stéphan Thomassé, Anders Yeo
DASFAA
2007
IEEE
139views Database» more  DASFAA 2007»
14 years 2 months ago
Self-tuning in Graph-Based Reference Disambiguation
Nowadays many data mining/analysis applications use the graph analysis techniques for decision making. Many of these techniques are based on the importance of relationships among t...
Rabia Nuray-Turan, Dmitri V. Kalashnikov, Sharad M...