Sciweavers

1067 search results - page 83 / 214
» Probabilistic regular graphs
Sort
View
85
Voted
IPL
2000
105views more  IPL 2000»
15 years 12 days ago
Coverings that preserve sense of direction
Sense of direction is a property of labelled networks (i.e., arc-coloured graphs) that allows one to assign coherently local identifiers to other processors on the basis of the ro...
Paolo Boldi, Sebastiano Vigna
ICPR
2004
IEEE
16 years 1 months ago
Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...
Fred W. DePiero
ISPAN
2005
IEEE
15 years 6 months ago
The structure of super line graphs
For a given graph G = (V, E) and a positive integer k, the super line graph of index k of G is the graph Sk(G) which has for vertices all the k-subsets of E(G), and two vertices S...
Jay Bagga, Daniela Ferrero
91
Voted
JGT
2007
112views more  JGT 2007»
15 years 15 days ago
The 2-dimensional rigidity of certain families of graphs
Laman’s characterization of minimally rigid 2-dimensional generic frameworks gives a matroid structure on the edge set of the underlying graph, as was first pointed out and expl...
Bill Jackson, Brigitte Servatius, Herman Servatius
95
Voted
FAC
2002
66views more  FAC 2002»
15 years 12 days ago
Shallow Linear Action Graphs and their Embeddings
Action calculi, which generalise process calculi such as Petri nets, -calculus and ambient calculus, have been presented in terms of action graphs. We here offer linear action grap...
James J. Leifer, Robin Milner