5889 search results - page 295 / 1178 » Graph Layout Problems |
186
click to vote
NIPS
2004
15 years 8 months ago
2004
Given a directed graph in which some of the nodes are labeled, we investigate the question of how to exploit the link structure of the graph to infer the labels of the remaining u...
174
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 ...
171
click to vote
EJC
2010
15 years 6 months ago
2010
A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problem...
172
click to vote
DAM
2006
15 years 6 months ago
2006
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
213
click to vote
ALGORITHMICA
2010
15 years 5 months ago
2010
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...