Search Results - subject:"Graph theory"

Workflow graph verification using graph search techniques

Mahanti, Ambuj (contributor); … - 2008

Persistent link: https://www.econbiz.de/10003734600

On circular 2-factorizations of the complete tripartite graph

Briskorn, Dirk; Knust, Sigrid - 2008

Persistent link: https://www.econbiz.de/10011325652

Constructing fair sports leagues schedules

Briskorn, Dirk; Knust, Sigrid - 2008

Persistent link: https://www.econbiz.de/10011325653

Axiomatic characterization of the interval function of a graph

Mulder, Henry Martyn (contributor); … - 2008

- cation. It will be submitted elsewhere. Abstract A fundamental notion in metric graph theory is that of the interval func … paper, in the conviction that characterizing the interval function belongs to the cen- tral questions of metric graph theory …), 2067 { 2073. [19] E. Sampathkumar, B-systems, in: S. Arumugam, B.D. Acharya and E. Sam- pathkumar eds., Graph Theory and …

Persistent link: https://www.econbiz.de/10003780436

On the Sum of Laplacian Eigenvalues of Graphs

Haemers, Willem H. - 2008

Let k be a natural number and let G be a graph with at least k vertices. A.E. Brouwer conjectured that the sum of the k largest Laplacian eigenvalues of G is at most e(G) (k choose 2), where e(G) is the number of edges of G. We prove this conjecture for k = 2. We also show that if G is a tree,...

Persistent link: https://www.econbiz.de/10012722415

Business Process Verification : A Petri Net Approach

De Backer, Manu - 2008

In this report, we discuss the use of Petri Net language theory for business process modeling. Essentially, the focus is on the opportunities of the modeling technique for analysis and verification. Semantic compatibility, as opposed to syntactic compatibility, is concerned with the...

Persistent link: https://www.econbiz.de/10012725491

On the Lovasz O-Number of Almost Regular Graphs with Application to Erdos-Renyi Graphs

de Klerk, Etienne - 2008

We consider k-regular graphs with loops, and study the Lovasz O-numbers and Schrijver O-numbers of the graphs that result when the loop edges are removed. We show that the O-number dominates a recent eigenvalue upper bound on the stability number due to Godsil and Newman [C.D. Godsil and M.W....

Persistent link: https://www.econbiz.de/10012726875

Network games

Galeotti, Andrea; Goyal, Sanjeev; Jackson, Matthew O.; … - 2008

Persistent link: https://www.econbiz.de/10003651828

STRONG EQUILIBRIA IN THE VEHICLE ROUTING GAME

ZENKEVICH, NIKOLAY; ZYATCHIN, ANDREY - In: International Game Theory Review (IGTR) 16 (2014) 04, pp. 1450013-1

This paper introduces an extension of the vehicle routing problem by including several distributors in competition. Each customer is characterized by demand and a wholesale price. Under this scenario a solution may have unserviced customers and elementary routes with no customer visits. The...

Persistent link: https://www.econbiz.de/10011096375

A 4D-sequencing approach for air traffic management

Prot, D.; Rapine, C.; Constans, S.; Fondacci, R. - In: European Journal of Operational Research 237 (2014) 2, pp. 411-425

The current air traffic system is forecasted to face strong challenges due to the continuous increase in air traffic demand. Hence, there is a need for new types of organization permitting a more efficient air traffic management, with both a high capacity and a high level of safety, and possibly...

Persistent link: https://www.econbiz.de/10011097819