4913 search results - page 185 / 983 » Results and Perspectives of the G |
175
click to vote
GD
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. Many graph drawing algorithms use st-numberings (st-orientations or bipolar orientations) as a first step. An st-numbering of a biconnected undirected graph defines a d...
164
click to vote
DAC
1989
ACM
15 years 10 months ago
1989
ACM
We present a new 0 (n2) heuristic for hypergraph min-cut bipartitioning, an important problem in circuit placement. Fastest previous methods for this problem are O(n2 log n). Our ...
169
click to vote
FLAIRS
2001
15 years 8 months ago
2001
Recently we have proposed an algorithm of constructing hierarchical neural network classifiers (HNNC), that is based on a modification of error back-propagation. This algorithm co...
163
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We show that the number of k-matching in a given undirected graph G is equal to the number of perfect matching of the corresponding graph Gk on an even number of vertices divided ...
164
click to vote
SLOGICA
2002
15 years 6 months ago
2002
A survey is given of results about coherence for categories with finite products and coproducts. For these results, which were published previously by the authors in several places...