Filters








2,323 Hits in 2.8 sec

Acyclic networks maximizing the printing complexity

Franck Guingne, Florent Nicart, André Kempe
2004 Theoretical Computer Science  
This article estimates the worst-case running time complexity for traversing and printing all successful paths of a normalized trim acyclic automaton.  ...  Then, we prove that the complexity is maximal when we have a distribution of e (Napier constant) outgoing arcs per state on average, and that it can be exponential in the number of arcs.  ...  We define the complexity of a network A by the sum of the lengths of its successful paths: C A = ∈ (A ) | |. Thus, the complexity of traversing and printing a network is defined by: PC = k · C A .  ... 
doi:10.1016/j.tcs.2004.07.006 fatcat:lxcdnkv7nzew3f2k42a3e7ypgi

Author index

2004 Theoretical Computer Science  
Kempe, Acyclic networks maximizing the printing complexity (1-2) 39-51 H. ahnle, R., N.V. Murray and E. Rosenthal, Linearity and regularity with negation normal form (3) 325-354 Huang, H., T.-y.  ...  Miyamoto (1-2) , A.N., Reducing the time complexity of testing for local threshold testability (1-2) 151-160 Ukkonen, E., see H.  ... 
doi:10.1016/s0304-3975(04)00751-0 fatcat:weaueldicfa4ze345ivqihpoh4

Acyclic Depth Partition of a Complex Subcontracting Network :

Tsutomu (Tom) NAKANO
2003 Riron to hoho  
Applying the concept of acyclic network, the analysis converted the complex regional subcontracting networks into a simpler form.  ...  The present research unveiled inter-industry dynamics deeply embedded in the extremely complex subcontracting networks in a large-scale industrial district, where over 7,000 small-and medium-size enterprises  ...  Acyclic depth partition and Ohta's subcontracting network As briefly explained earlier, one effective way to partition a complex network is to apply the notion of acyclic network.  ... 
doi:10.11218/ojjams.18.71 fatcat:vxueqerrozg7tkqx746tvrq34u

On graph combinatorics to improve eigenvector-based measures of centrality in directed networks

Argimiro Arratia, Carlos Marijuán
2016 Linear Algebra and its Applications  
We build our topological classification starting from unidirectional rooted trees and up to more complex hierarchical structures such as acyclic digraphs, bidirectional and cyclical rooted trees (obtained  ...  networks Abstract We present a combinatorial study on the rearrangement of links in the structure of directed networks for the purpose of improving the valuation of a vertex or group of vertices as established  ...  We propose to do this analysis progressively with respect to the topological complexity of the network.  ... 
doi:10.1016/j.laa.2016.04.011 fatcat:6hg57gkvzbagnhpafsgrhyrzvm

Enumeration of Enumeration Algorithms [article]

Kunihiro Wasa
2016 arXiv   pre-print
Complexity O(nm + m 2 ) time per enumerated and printed graph. Comment m is the number of edges of printed graphs.  ...  Comment M is the number of solutions, k is the connectivity of G, and C = k|V | min(k(|V | + |E|), A), where A is the time complexity of the best maximum network flow algorithm for unit network.  ... 
arXiv:1605.05102v2 fatcat:bwmhesagkje5hmynqyij7jv224

Page 4140 of Mathematical Reviews Vol. , Issue 89G [page]

1989 Mathematical Reviews  
complexity of minimum cut and maximum flow problems in an acyclic network.  ...  Summary: “We establish that finding a minimum cut or a maxi- mum flow in an acyclic network is no easier than the corresponding problem on a general network.” 89g:90100 90B10 Sapko, A. V.  ... 

Joint pricing and inventory management with deterministic demand and costly price adjustment

Xin Chen, Peng Hu
2012 Operations Research Letters  
We develop polynomial time algorithms to maximize the total profit and discuss their computational complexity.  ...  In this model, an ordering quantity and a price are decided simultaneously at the beginning of each period, demand of the period depends on the price, and a price adjustment cost is incurred if the price  ...  Thus determining an optimal pricing plan is equivalent to finding a longest path from v 0 to v e in the acyclic network (V, E ). We next discuss the computational complexity.  ... 
doi:10.1016/j.orl.2012.05.011 fatcat:nr3b5qo3pfhynkismv46vxrz44

Influence, originality and similarity in directed acyclic graphs

S. Gualdi, M. Medo, Y.-C. Zhang
2011 Europhysics letters  
We introduce a framework for network analysis based on random walks on directed acyclic graphs where the probability of passing through a given node is the key ingredient.  ...  We illustrate its use in evaluating the mutual influence of nodes and discovering seminal papers in a citation network.  ...  Since the network is acyclic, ∀x : A x ∩ P x = ∅.  ... 
doi:10.1209/0295-5075/96/18004 fatcat:ry42gdtpuvawljzmo7uqqowhc4

The brick polytope of a sorting network

Vincent Pilaud, Francisco Santos
2012 European journal of combinatorics (Print)  
In this paper, we construct the brick polytope of a sorting network, obtained as the convex hull of the brick vectors associated to each pseudoline arrangement supported by the network.  ...  We furthermore discuss the brick polytopes of sorting networks supporting pseudoline arrangements which correspond to multitriangulations of convex polygons: our polytopes only realize subgraphs of the  ...  This complex is pure of dimension m −  n 2  − 1, its maximal cells correspond to pseudoline arrangements supported by N and its ridge graph is the graph of flips G(N ).  ... 
doi:10.1016/j.ejc.2011.12.003 fatcat:tw44djd5wzdrhftzchbjp6skae

Bayesian Network Structure Learning Using Causality

Zhen Xu, Sargur N. Srihari
2014 2014 22nd International Conference on Pattern Recognition  
Given a partial directed acyclic graph, causal pairs with the highest accuracy are inferred with the fewest number of pairwise causal inferences.  ...  Integrating both the global and local views, the proposed algorithm learns a high quality Bayesian network without using any score-based searching.  ...  The first rule utilizes directed acyclic property to orient the edges. Note that the circle contains undirected edge does not violate directed acyclic property.  ... 
doi:10.1109/icpr.2014.610 dblp:conf/icpr/XuS14 fatcat:hvpie2gizbdnhkduayvogmq6qa

Decomposing a relation into a tree of binary relations

Rina Dechter
1990 Journal of computer and system sciences (Print)  
The method can be extended to decomposing a relation into an acyclic database of bounded relation arity.  ...  This is the case, for example, when databases are used for describing natural phenomena such as relations between diseases and their characteristic manifestations or for describing complex physical systems  ...  I thank the students, Bit Moshe and Ronit Nadam, who implemented the tree-decomposition algorithm and provided the experimental results presented in the paper. I also thank the referees of this paper.  ... 
doi:10.1016/0022-0000(90)90031-f fatcat:dvg7acmpnjczlldmwbv3xu2uga

Heuristic algorithms in computational molecular biology

Richard M. Karp
2011 Journal of computer and system sciences (Print)  
We introduce two areas of current research in which we are applying the framework: implicit hitting set problems and analysis of protein-protein interaction networks, with emphasis on a specific problem  ...  The work on PPI networks, and specifically the colorful graph problem, is a continuation of joint work with Falk Hueffner, Sharon Bruckner, Ron Shamir and Roded Sharan reported in [1, 2] .  ...  Acknowledgments The ongoing research on the multi-genome alignment is being conducted jointly with Erick Moreno Centeno.  ... 
doi:10.1016/j.jcss.2010.06.009 fatcat:snctve3pw5fkxf36ehd6oxsqky

Topology Preserving Thinning of Cell Complexes

Pawel Dlotko, Ruben Specogna
2014 IEEE Transactions on Image Processing  
Acyclicity tables for cubical and simplicial complexes and an open source implementation of the thinning algorithm are provided as additional material to allow their immediate use in the vast number of  ...  Using acyclicity tables render the implementation of thinning algorithms straightforward.  ...  Every cell T ∈ K appears in the while loop only k times, where k is maximal number of neighbors of a top dimensional cell in the complex.  ... 
doi:10.1109/tip.2014.2348799 pmid:25137728 fatcat:ex7v3rsgxjeh5ga2gzpwuoqjlu

Macrocyclic Hamilton-type receptors comprising a ferrocene pivot

Luca Pisciottani, Maxime Douarre, Brigitte Bibal, Clotilde Davies, Holly Roberts, Brice Kauffmann, Sarah L. Horswell, James H. R. Tucker, Nathan D. McClenaghan
2018 Supramolecular chemistry (Print)  
The crystallographic structure, barbiturate guest-binding studies and electrochemical data are provided for the more strongly-binding macrocycle 2.  ...  which incorporate a central electroactive ferrocene moiety grafted with two adjacent bis(amido)pyridine motifs and an aliphatic tether (14 and 18 methylene units for 1 and 2, respectively) completing the  ...  Acknowledgements Financial support from the Agence Nationale de la Recherche (project ANR-16-CE29-0011; pre-doctoral bourse M.D), University of Bordeaux; CNRS and Ministère de la Recherche et de l'Enseignement  ... 
doi:10.1080/10610278.2018.1426856 fatcat:fz37fakt7jcr7i2aug7rkr5yye

The complexity of circuit value and network stability

Ernst W. Mayr, Ashok Subramanian
1992 Journal of computer and system sciences (Print)  
We study the complexity of the circuit value problem and a new problem, network stability, when fanout is limited. This leads to new classes of problems within 8.  ...  for network stability, and logspace reductions between circuit value and network stability  ...  If the underlying directed graph of a network is acyclic, the network is called a circuit. A circuit computes a function in the usual manner. A network (circuit) is said to be over a basis !  ... 
doi:10.1016/0022-0000(92)90024-d fatcat:m6t6ddbkabgc3mqzyz42cs7zp4
« Previous Showing results 1 — 15 out of 2,323 results