Results 1  10
of
1,390
ArtinMazur Zeta Function on Trees with Infinite Edges
"... Proceedings, pp. 65—73 We generalize for trees, with infinite edges and finite branching points, the MilnorThurston’s main relationship between kneading determinant and ArtinMazur zeta function of a piecewise monotone interval map. 1 Introduction and statement of the main result One of the extreme ..."
Abstract
 Add to MetaCart
Proceedings, pp. 65—73 We generalize for trees, with infinite edges and finite branching points, the MilnorThurston’s main relationship between kneading determinant and ArtinMazur zeta function of a piecewise monotone interval map. 1 Introduction and statement of the main result One
Infinite edge partition models for overlapping community detection and link prediction.
 In AISTATS,
, 2015
"... Abstract A hierarchical gamma process infinite edge partition model is proposed to factorize the binary adjacency matrix of an unweighted undirected relational network under a BernoulliPoisson link. The model describes both homophily and stochastic equivalence, and is scalable to big sparse networ ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Abstract A hierarchical gamma process infinite edge partition model is proposed to factorize the binary adjacency matrix of an unweighted undirected relational network under a BernoulliPoisson link. The model describes both homophily and stochastic equivalence, and is scalable to big sparse
PROBLEMS AND RESULTS ON 3CHROMATIC HYPERGRAPHS AND SOME RELATED QUESTIONS
 COLLOQUIA MATHEMATICA SOCIETATIS JANOS BOLYAI 10. INFINITE AND FINITE SETS, KESZTHELY (HUNGARY)
, 1973
"... A hypergraph is a collection of sets. This paper deals with finite hypergraphs only. The sets in the hypergraph are called edges, the elements of these edges are points. The degree of a point is the number of edges containing it. The hypergraph is runiform if every edge has r points. A hypergraph i ..."
Abstract

Cited by 311 (0 self)
 Add to MetaCart
with chromatic number 2 were first investigated systematically by M i 11 e r (who used the term property B) in the case of infinite edges. There now is a large literature of this subject both for finite and infinite sets. The main idea behind our investigations is that being simple or being a clique imposes
Using Canny’s criteria to derive a recursively implemented optimal edge detector
 J. OF COMP. VISION
, 1987
"... A highly efficient recursive algorithm for edge detection is presented. Using Canny's design [1], we show that a solution to his precise formulation of detection and localization for an infinite extent filter leads to an optimal operator in one dimension, which can be efficiently implemented by ..."
Abstract

Cited by 289 (14 self)
 Add to MetaCart
A highly efficient recursive algorithm for edge detection is presented. Using Canny's design [1], we show that a solution to his precise formulation of detection and localization for an infinite extent filter leads to an optimal operator in one dimension, which can be efficiently implemented
Computing Simulations on Finite and Infinite Graphs
, 1996
"... . We present algorithms for computing similarity relations of labeled graphs. Similarity relations have applications for the refinement and verification of reactive systems. For finite graphs, we present an O(mn) algorithm for computing the similarity relation of a graph with n vertices and m edges ..."
Abstract

Cited by 195 (7 self)
 Add to MetaCart
infinite graphs with finite similarity relations. It follows that the refinement problem and the 8CTL modelchecking problem are decidable for 2D rectangular automata. 1 Introduction A labeled graph G = (V; E;A; hh\Deltaii) consist of a (possibly infinite) set V of vertices, a set E ` V 2 of edges
Shortestpath and minimumdelay algorithms in networks with timedependent edgelength
 Journal of the ACM
, 1990
"... We consider in this paper the shortestpath problem in networks in which the delay (or weight) of the edges changes with time according to arbitrary functions. We present algorithms for finding the shortestpath and minimumdelay under various waiting constraints and investigate the properties of th ..."
Abstract

Cited by 135 (6 self)
 Add to MetaCart
We consider in this paper the shortestpath problem in networks in which the delay (or weight) of the edges changes with time according to arbitrary functions. We present algorithms for finding the shortestpath and minimumdelay under various waiting constraints and investigate the properties
Geometric Shortest Paths and Network Optimization
 Handbook of Computational Geometry
, 1998
"... Introduction A natural and wellstudied problem in algorithmic graph theory and network optimization is that of computing a "shortest path" between two nodes, s and t, in a graph whose edges have "weights" associated with them, and we consider the "length" of a path to ..."
Abstract

Cited by 187 (15 self)
 Add to MetaCart
Introduction A natural and wellstudied problem in algorithmic graph theory and network optimization is that of computing a "shortest path" between two nodes, s and t, in a graph whose edges have "weights" associated with them, and we consider the "length" of a path
An infinite series of regular edge but not vertextransitive graphs
 J. Graph Theory
, 2002
"... Abstract. Let n be an integer and q be a prime power. Then for any 3 ≤ n ≤ q − 1, or n = 2 and q odd, we construct a connected qregular edgebut not vertex transitive graph of order 2qn+1. This graph is defined via a system of equations over the finite field of q elements. For n = 2 and q = 3, our ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
Abstract. Let n be an integer and q be a prime power. Then for any 3 ≤ n ≤ q − 1, or n = 2 and q odd, we construct a connected qregular edgebut not vertex transitive graph of order 2qn+1. This graph is defined via a system of equations over the finite field of q elements. For n = 2 and q = 3, our graph is isomorphic to the Gray graph. 1.
New Infinite Families of 2EdgeBalanced Graphs
, 2013
"... Abstract: A graph G of order n is called tedgebalanced if G satisfies the property that there exists a positive λ for which every graph of order n and size t is contained in exactly λ distinct subgraphs of Kn isomorphic to G. We call λ the index of G. In this article, we obtain new infinite ..."
Abstract
 Add to MetaCart
Abstract: A graph G of order n is called tedgebalanced if G satisfies the property that there exists a positive λ for which every graph of order n and size t is contained in exactly λ distinct subgraphs of Kn isomorphic to G. We call λ the index of G. In this article, we obtain new infinite
THE SUPER EDGEGRACEFULNESS OF TWO INFINITE FAMILIES OF TREES
"... ABSTRACT. For a positive integer q, let L(q) be the set of k integers, smallest in absolute value, and symmetric about O. A connected, simple (p, q)graph G = (V, E) is said to be super edgegraceful if there is a bijection f: E> L(q) inducing a bijection r: V> L(p) via r(u) = L{u,v}EEf ..."
Abstract
 Add to MetaCart
ABSTRACT. For a positive integer q, let L(q) be the set of k integers, smallest in absolute value, and symmetric about O. A connected, simple (p, q)graph G = (V, E) is said to be super edgegraceful if there is a bijection f: E> L(q) inducing a bijection r: V> L(p) via r(u) = L
Results 1  10
of
1,390