Information Technology

24

click to vote

EMISA
2002
Springer

83views Information Technology» more EMISA 2002»

Tutorium: Evaluierung von GPM-Modellierungswerkzeugen

13 years 8 months ago

Download sunsite.informatik.rwth-aachen.de

Markus Nüttgens

claim paper

Read More »

26

click to vote

EMISA
2002
Springer

107views Information Technology» more EMISA 2002»

A new reduction method for the analysis of large workflow models

13 years 8 months ago

Download sunsite.informatik.rwth-aachen.de

Abstract: This paper presents a new net-reduction methodology to facilitate the analysis of large workflow models. We propose an enhanced algorithm based on reducible subnet identi...

Loucif Zerguini, Kees M. van Hee

claim paper

Read More »

22

click to vote

EJC
2002

93views Information Technology» more EJC 2002»

Constructing a Class of Symmetric Graphs

13 years 8 months ago

Download www.ms.unimelb.edu.au

Sanming Zhou

claim paper

Read More »

23

click to vote

EJC
2002

84views Information Technology» more EJC 2002»

On the Number of 3-Edge Colorings of Cubic Graphs

13 years 8 months ago

Download www.cadence.com

Christian Szegedy

claim paper

Read More »

32

click to vote

EJC
2002

105views Information Technology» more EJC 2002»

Neighbourhood Graphs of Cayley Graphs for Finitely-generated Groups

13 years 8 months ago

Download www.math.tu-graz.ac.at

In this short note the neighbourhood graph of a Cayley graph is considered. It has as nodes a symmetric generating set of a finitely-generated group . Two nodes are connected by a...

Markus Neuhauser

claim paper

Read More »

25

click to vote

EJC
2002

131views Information Technology» more EJC 2002»

Bridging Semisymmetric and Half-Arc-Transitive Actions on Graphs

13 years 8 months ago

Download www.imfm.si

Dragan Marusic, Primoz Potocnik

claim paper

Read More »

25

click to vote

EJC
2002

115views Information Technology» more EJC 2002»

Cycle Cover Ratio of Regular Matroids

13 years 8 months ago

Download www.math.wvu.edu

A cycle in a matroid is a disjoint union of circuits. This paper proves that every regular matroid M without coloops has a set S of cycles whose union is E(M) such that every elem...

Hong-Jian Lai, Hoifung Poon

claim paper

Read More »

27

click to vote

EJC
2002

145views Information Technology» more EJC 2002»

Acute Triangulations of Polygons

13 years 8 months ago

Download web.mit.edu

In this paper, we prove the existence of acute triangulations for general polyhedral surfaces. We also show how to obtain nonobtuse subtriangulations of triangulated polyhedral sur...

Hiroshi Maehara

claim paper

Read More »

21

click to vote

EJC
2002

77views Information Technology» more EJC 2002»

Asymptotic Clique Covering Ratios of Distance Graphs

13 years 8 months ago

Download www.calstatela.edu

Daphne Der-Fen Liu, Xuding Zhu

claim paper