5473 search results - page 264 / 1095 » On the graph isomorphism problem |
191
click to vote
DAM
2008
15 years 7 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 ...
194
click to vote
EJC
2010
15 years 7 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...
191
click to vote
DAM
2006
15 years 7 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...
229
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...
281
click to vote
CPM
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We consider the problem of highly space-efficient representation of separable graphs while supporting queries in constant time in the RAM with logarithmic word size. In p...