نتایج جستجو برای: commuting graphs

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

2006
Wayne Simpson Anne van der Veen

The spatial distribution of households and firms, or urban spatial structure, is a core element of the study of urban economics and the crucial determinant of commuting patterns. This paper examines developments in the analysis of urban spatial structure and commuting that are related to the urban labour market that is the analysis of labour supply and labour demand in a spatial context. These ...

2015
Mehdi Menai Hélène Charreire Thierry Feuillet Paul Salze Christiane Weber Christophe Enaux Valentina A. Andreeva Serge Hercberg Julie-Anne Nazare Camille Perchoux Chantal Simon Jean-Michel Oppert

BACKGROUND Increasing active transport behavior (walking, cycling) throughout the life-course is a key element of physical activity promotion for health. There is, however, a need to better understand the correlates of specific domains of walking and cycling to identify more precisely at-risk populations for public health interventions. In addition, current knowledge of interactions between dom...

Journal: :J. Graph Algorithms Appl. 2009
Michael Jünger Michael Schulz

We examine the simultaneous embedding with fixed edges problem for two planar graphs G1 and G2 with the focus on their intersection S = G1∩G2. In particular, we will present the complete set of intersection graphs S that guarantee a simultaneous embedding with fixed edges for (G1, G2). More formally, we define the subset ISEFE of all planar graphs as follows: A graph S lies in ISEFE if every pa...

Journal: :Theor. Comput. Sci. 1999
Bruno Courcelle

We prove that the unique decomposition of connected graphs defined by Tutte is definable by formulas of Monadic Second-Order Logic. This decomposition has two levels: every connected graph is a tree of "2-connected components" called blocks ; every 2-connected graph is a tree of so-called 3-blocks. Our proof uses 2dags which are certain acyclic orientations of the considered graphs. We obtain a...

Journal: :J. Comb. Theory, Ser. B 2005
Sang-il Oum

The rank-width is a graph parameter related in terms of fixed functions to cliquewidth but more tractable. Clique-width has nice algorithmic properties, but no good “minor” relation is known analogous to graph minor embedding for tree-width. In this paper, we discuss the vertex-minor relation of graphs and its connection with rank-width. We prove a relationship between vertex-minors of bipartit...

2009
Sandeep Kaur Rinkle Aggarwal

..........................................................................................iii Table of contents.................................................................................iv List of Figures.................................................................................viii List of Tables......................................................................................x...

2004
M R Kibler

In this paper the dynamical noninvariance group SO(4, 2) for a hydrogen-like atom is derived through two different approaches. The first one is by an established traditional ascent process starting from the symmetry group SO(3). This approach is presented in a mathematically oriented original way with a special emphasis on maximally superintegrable systems, N-dimensional extension and little gr...

Journal: :Transactions of the American Mathematical Society 2003

2007
Dan A. Black Natalia Kolesnikova Lowell J. Taylor

This paper documents a little-noticed feature of US labor markets—very large variation in the labor supply of married women across cities. We focus on cross-city differences in commuting times as a potential explanation for this variation. We start with a model in which commuting times introduce non-convexities into the budget set. Empirical evidence is consistent with the model’s predictions: ...

2003
Radko Mesiar Susanne Saminger-Platz

We will investigate so-called commuting operators and their relationship to bisymmetry and domination. In the case of bisymmetric aggregation operators we will show a sufficient condition ensuring that two operators commute, while for bisymmetric aggregation operators with neutral element we will even give a full characterization of commuting n-ary operators by means of unary commuting operators.

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

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