Sciweavers

281 search results - page 31 / 57
» On Embedding a Graph on Two Sets of Points
Sort
View
DAM
2011
14 years 4 months ago
Untangling planar graphs from a specified vertex position - Hard cases
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an ...
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Math...
CCCG
2007
14 years 11 months ago
Computing Acute and Non-obtuse Triangulations
We propose a method for computing acute (non-obtuse) triangulations. That is, for a given two dimensional domain (a set of points or a planar straight line graph), we compute a tr...
Hale Erten, Alper Üngör
WADT
1997
Springer
15 years 1 months ago
An inductive view of graph transformation
The dynamic behavior of rule-based systems (like term rewriting systems 24], process algebras 27], and so on) can be traditionally determined in two orthogonal ways. Either operati...
Fabio Gadducci, Reiko Heckel
77
Voted
DM
2008
97views more  DM 2008»
14 years 9 months ago
On uniquely k-determined permutations
Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce the notion of uniquely k-determined permutations. We give two criteria f...
Sergey V. Avgustinovich, Sergey Kitaev
SIGIR
2006
ACM
15 years 3 months ago
Contextual search and name disambiguation in email using graphs
Similarity measures for text have historically been an important tool for solving information retrieval problems. In many interesting settings, however, documents are often closel...
Einat Minkov, William W. Cohen, Andrew Y. Ng