9532 search results - page 402 / 1907 » Logic, Graphs, and Algorithms |
159
click to vote
CCCG
2007
15 years 8 months ago
2007
We study the problem how to draw a planar graph such that every vertex is incident to an angle greater than π. In general a straightline embedding cannot guarantee this property....
133
click to vote
BILDMED
2006
15 years 8 months ago
2006
Astroglial cells in the central nervous system (CNS) are able to change their morphology and shape after different kinds of stimuli. We have developed a method for the structural d...
176
click to vote
NIPS
2004
15 years 8 months ago
2004
We formulate the problem of graph inference where part of the graph is known as a supervised learning problem, and propose an algorithm to solve it. The method involves the learni...
111
click to vote
DAM
2010
15 years 6 months ago
2010
Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal mathematical framework an...
176
click to vote
DAM
2008
15 years 6 months ago
2008
: In this paper, we study a new problem of convex drawing of planar graphs with non-convex boundary constraints. It is proved that every triconnected plane graph whose boundary is ...