Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: graph operations

Sortuj według:

Ogranicz wyniki do:

Networks with Extremal Closeness

Rupnik Poklukar Darja, Žerovnik Janez

Fundamenta Informaticae

2019

Vol. 167, nr 3

219--234

Closeness is a measure of centrality, an important feature of communication and social networks. Extremal networks among all graphs and among several subclasses of graphs including trees and cacti are given. In addition, maximal graphs among cacti with fixed number of cycles and among cacti with given number of cut edges are provided.

Hierarchical graphs in creative design

Grabska E., Palacz W., Szyngiera P.

Machine Graphics and Vision

2000

Vol. 9, No. 1/2

115-122

This paper is concerned with computational aspects of creative design. We propose a new representation of artifacts' structures: hierarchical graphs. This type of graphs enables to define a gluing operation. The proposed operation is illustrated by an example of designing gardens.

Function-structure computer-aided design model

Borkowski A., Grabska E., Hliniak G.

Machine Graphics and Vision

1999

Vol. 8, No. 3

367-381

This paper considers defining functional requirements of the designed object and transforming them into the object structure. The proposed Function Structure Editor (FSE) enables to bridge the gap between the design specification and the object structure. When utilising FSE the designer uses graph operations which are automatically transformed into graph rules allowing one to generate potential solutions of a given design problem. The proposed methodology is illustrated by examples of designing the teapot and the floor-layout of the house.