1201 search results - page 51 / 241 » Linear Probing and Graphs |
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Orbits of graphs under local complementation (LC) and edge local complementation (ELC) have been studied in several different contexts. For instance, there are connections between...
AAIM
2007
Springer
14 years 5 months ago
2007
Springer
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...
STOC
1996
ACM
14 years 3 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
IPL
2006
13 years 11 months ago
2006
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is the k...
ALGORITHMICA
2002
13 years 11 months ago
2002
We present several simple methods to construct planar, strictly upward, strongly order-preserving, straight-line drawings of any n-node binary tree. In particular, it is shown that...