37 search results - page 7 / 8 » On connectivity of consecutive-d digraphs |
FOCS
1994
IEEE
15 years 1 months ago
1994
IEEE
We describe algorithms for finding the k shortest paths connecting a given pair of vertices in a digraph (allowing cycles). Our algorithms output an implicit representation of the...
CP
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
IWPEC
2004
Springer
15 years 2 months ago
2004
Springer
Consider the following problem, that we call “Chordless Path through Three Vertices” or CP3V, for short: Given a simple undirected graph G = (V, E), a positive integer k, and t...
SNPD
2007
14 years 11 months ago
2007
In this paper, we propose a new class of interconnection networks, called “biswapped networks” (BSNs). Each BSN is built of 2n copies of some n-node basis network using a simp...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
This paper studies the opinion dynamics model recently introduced by Hegselmann and Krause: (1) each agent in a group mantains a real number describing its opinion, (2) each agent ...