نتایج جستجو برای: future orientations

تعداد نتایج: 554233  

Journal: :CoRR 2017
Anders Aamand Niklas Hjuler Jacob Holm Eva Rotenberg

Given a graph, does there exist an orientation of the edges such that the resulting directed graph is strongly connected? Robbins’ theorem [Robbins, Am. Math. Monthly, 1939] states that such an orientation exists if and only if the graph is 2-edge connected. A natural extension of this problem is the following: Suppose that the edges of the graph is partitioned into trails. Can we orient the tr...

Journal: :Signal Processing 2007
Franck Michelet Jean-Pierre Da Costa Olivier Lavialle Yannick Berthoumieu Pierre Baylou Christian Germain

In the last decades, orientation estimation has often been investigated for instance in the domain of still image analysis for feature extraction [5] or in the context of video stream processing for motion analysis [10] [20] [27]. Applications of orientation estimation vary, for example, from the enhancement of ancient engravings to the analysis of fingerprint images or seismic data [8]. Orient...

2008
Matthew Macauley Henning S. Mortveit

The cyclic and dihedral groups can be made to act on the set Acyc(Y ) of acyclic orientations of an undirected graph Y , and this gives rise to the equivalence relations ∼κ and ∼δ, respectively. These two actions and their corresponding equivalence classes are closely related to combinatorial problems arising in the context of Coxeter groups, sequential dynamical systems, the chip-firing game, ...

Journal: :J. Graph Algorithms Appl. 2017
Glencora Borradaile Jennifer Iglesias Theresa Migler Antonio Ochoa Gordon T. Wilfong Lisa Zhang

Given an undirected graph, one can assign directions to each of the edges of the graph, thus orienting the graph. To be as egalitarian as possible, one may wish to find an orientation such that no vertex is unfairly hit with too many arcs directed into it. We discuss how this objective arises in problems resulting from telecommunications. We give optimal, polynomial-time algorithms for: finding...

Journal: :Oper. Res. Lett. 2013
András Frank Csaba Király

A tree-composition is a tree-like family that serves to describe the obstacles to k-edge-connected orientability of mixed graphs. Here we derive a structural result on tree-compositions that gives rise to a simple algorithm for computing an obstacle when the orientation does not exist. As another application, we show a min–max theorem on the minimal in-degree of a given node set in a k-edge-con...

2007

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...

1996
Abdelhak Djouadi

I discuss the physics prospects at future high–energy ee linear colliders. After summarizing some aspects of these future machines, I will review a few topics in the Standard Model which can be studied at these colliders: top quark, W/Z vector bosons and Higgs particles physics. A brief discussion on the exploration of extensions of the Standard Model such as Supersymmetry and Grand Unified The...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید