Titlebook: Combinatorial Algorithms; 24th International W Thierry Lecroq,Laurent Mouchard Conference proceedings 2013 Springer-Verlag Berlin Heidelber

使服水土

Aqueous size exclusion chromatographyives. The only existing algorithm for this problem uses divide and conquer and, in order to achieve an .(. log.) running time, requires the use of the (complicated) linear-time shortest-paths algorithm for planar graphs.

合乎習(xí)俗

Deciding Representability of Sets of Words of Equal Length in Polynomial Timewas considered and shown to be in .. However, membership in . remained open. In this paper, we show that deciding if a subset is representable can be done in polynomial time. Our approach is graph theoretical.

fastness

Boundary-to-Boundary Flows in Planar Graphsives. The only existing algorithm for this problem uses divide and conquer and, in order to achieve an .(. log.) running time, requires the use of the (complicated) linear-time shortest-paths algorithm for planar graphs.