446 search results - page 41 / 90 » A fast algorithm for computing steiner edge connectivity |
101
click to vote
DAM
1999
14 years 9 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
108
click to vote
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
Given an (undirected) graph G = V; E; a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a class...
125
click to vote
ICPR
2000
IEEE
15 years 2 months ago
2000
IEEE
A new concept and algorithm are presented for noniterative robust estimation of piecewise smooth curves of maximal edge strength in small image windows – typically ¢¡£ to...
CGI
2000
IEEE
15 years 2 months ago
2000
IEEE
An ideal triangle mesh compression technology would simultaneously support the following three objectives: (1) progressive refinements of the received mesh during decompression, (...