3008 search results - page 372 / 602 » Independence in connected graphs |
184
click to vote
SSPR
1998
Springer
15 years 11 months ago
1998
Springer
This paper presents a probabilistic similarity measure for object recognition from large libraries of line-patterns. We commence from a structural pattern representation which use...
190
click to vote
PLDI
1994
ACM
15 years 11 months ago
1994
ACM
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flo...
192
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
A multi-agent system can be analyzed and specified as an organization consisting of roles and their relations. The performance of an organization depends on many factors among whi...
170
click to vote
APVIS
2001
15 years 8 months ago
2001
Traditional graph drawing is only concerned with viewing of data and relations amount data items. It uses a graph model to present the data items and the relations and tries to ca...
202
click to vote
CATS
1998
15 years 8 months ago
1998
Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...