540 search results - page 40 / 108 » New bounds on the edge number of a k-map graph |
COMPGEOM
2003
ACM
15 years 5 months ago
2003
ACM
Given a Morse function over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight u...
102
click to vote
ICALP
2004
Springer
15 years 5 months ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
109
click to vote
TCS
2008
14 years 11 months ago
2008
1 Elimination Game is a well known algorithm that simulates Gaussian elimination of matrices on graphs, and it computes a triangulation of the input graph. The number of fill edge...
100
click to vote
SIAMDM
2010
14 years 10 months ago
2010
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...
SOFSEM
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...