Sciweavers

36 search results - page 4 / 8
» On cycles through specified vertices
Sort
View
ARSCOM
2004
75views more  ARSCOM 2004»
13 years 7 months ago
On Theorems Equivalent with Kotzig's Result on Graphs with Unique 1-Factors
We show that several known theorems on graphs and digraphs are equivalent. The list of equivalent theorems include Kotzig's result on graphs with unique 1-factors, a lemma by...
Stefan Szeider
SPATIALCOGNITION
2000
Springer
13 years 11 months ago
Investigating Spatial Reference Systems through Distortions in Visual Memory
Memory representations of spatial information require the choice of one or more reference systems to specify spatial relations. In two experiments we investigated the role of diffe...
Steffen Werner, Thomas Schmidt
ICSM
1997
IEEE
13 years 11 months ago
Software Change Through Design Maintenance
Conventional software engineering tends to focus on a small part of the software life cycle: the design and implementation of a product. The bulk of the lifetime cost is in the ma...
Ira D. Baxter, Christopher Pidgeon
OTM
2010
Springer
13 years 5 months ago
Knowledge Representation with Autonomic Ontologies
The important role given to domain ontologies for knowledge representation implies increasing need for development and maintenance of them. However, we have a scarcity of tools sup...
Stainam Nogueira Brandão, Jonice Oliveira, ...
ENDM
2007
68views more  ENDM 2007»
13 years 7 months ago
Detecting induced subgraphs
An s-graph is a graph with two kind of edges: subdivisible edges and real edges. A realisation of an s-graph B is any graph obtained by subdividing subdivisible edges of B into pa...
Benjamin Lévêque, David Y. Lin, Fr&ea...