643 search results - page 6 / 129 » Supereulerian planar graphs |
ISCC
2006
IEEE
14 years 1 months ago
2006
IEEE
Rectangular dualization is an effective, hierarchically oriented visualization method for network topologies and can be used in many other problems having in common with networks ...
GD
2007
Springer
14 years 1 months ago
2007
Springer
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this ...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
Given an undirected graph with edge lengths and a subset of nodes (called the terminals), the multiway cut (also called the multi-terminal cut) problem asks for a subset of edges,...
COCO
2010
Springer
13 years 5 months ago
2010
Springer
An even cycle in a graph is called nice by Lov