Results 1  10
of
56,063
The bidimensional theory of boundedgenus graphs
 SIAM JOURNAL ON DISCRETE MATHEMATICS
, 2004
"... ..."
ON THE EXISTENCE OF INFINITELY MANY ESSENTIAL SURFACES OF BOUNDED GENUS
"... if M is an irreducible, ∂irreducible 3manifold with boundary a single torus, and if M contains no genus one essential (incompressible and ∂incompressible) surfaces, then M cannot contain infinitely many distinct isotopy classes of essential surfaces of uniformly bounded genus. The main result in ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
if M is an irreducible, ∂irreducible 3manifold with boundary a single torus, and if M contains no genus one essential (incompressible and ∂incompressible) surfaces, then M cannot contain infinitely many distinct isotopy classes of essential surfaces of uniformly bounded genus. The main result
Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus
 SIAM Journal of Discrete Mathematics
, 1996
"... This paper develops new techniques for constructing separators for graphs embedded on surfaces of bounded genus. For any arbitrarily small positive " we show that any nvertex graph G of genus g can be divided in O(n + g) time into components whose sizes do not exceed "n by removing a set ..."
Abstract

Cited by 29 (4 self)
 Add to MetaCart
This paper develops new techniques for constructing separators for graphs embedded on surfaces of bounded genus. For any arbitrarily small positive " we show that any nvertex graph G of genus g can be divided in O(n + g) time into components whose sizes do not exceed "n by removing a
Fully dynamic algorithms for bounded genus graphs
, 1997
"... We present a deterministic algorithm that maintains the connected components of a graph as edges are inserted and deleted, provided the genus of the graph is bounded by a fixed constant. The algorithm runs in O(log2 n) amortized time per insertion, O(log3 n) amortized time per deletion, and O(log n ..."
Abstract
 Add to MetaCart
We present a deterministic algorithm that maintains the connected components of a graph as edges are inserted and deleted, provided the genus of the graph is bounded by a fixed constant. The algorithm runs in O(log2 n) amortized time per insertion, O(log3 n) amortized time per deletion, and O
Subexponential parameterized algorithms on graphs of boundedgenus and Hminorfree Graphs
"... ... Building on these results, we develop subexponential fixedparameter algorithms for dominating set, vertex cover, and set cover in any class of graphs excluding a fixed graph H as a minor. Inparticular, this general category of graphs includes planar graphs, boundedgenus graphs, singlecrossing ..."
Abstract

Cited by 63 (22 self)
 Add to MetaCart
... Building on these results, we develop subexponential fixedparameter algorithms for dominating set, vertex cover, and set cover in any class of graphs excluding a fixed graph H as a minor. Inparticular, this general category of graphs includes planar graphs, boundedgenus graphs, single
Polynomialtime approximation schemes for subsetconnectivity problems in boundedgenus graphs
, 2009
"... We present the first polynomialtime approximation schemes (PTASes) for the following subsetconnectivity problems in edgeweighted graphs of bounded genus: Steiner tree, lowconnectivity survivablenetwork design, and subset TSP. The schemes run in O(n log n) time for graphs embedded on both orien ..."
Abstract

Cited by 18 (4 self)
 Add to MetaCart
We present the first polynomialtime approximation schemes (PTASes) for the following subsetconnectivity problems in edgeweighted graphs of bounded genus: Steiner tree, lowconnectivity survivablenetwork design, and subset TSP. The schemes run in O(n log n) time for graphs embedded on both
Compact Routing Tables for Graphs of Bounded Genus
, 2000
"... This paper deals with compact shortest path routing tables on weighted graphs with n nodes. For planar graphs we show how to construct in linear time shortest path routing tables that require 8n + o(n) bits per node, and O(log 2+ n) bitoperations per node to extract the route, for any constant > ..."
Abstract

Cited by 30 (11 self)
 Add to MetaCart
; 0. We obtain the same bounds for graphs of crossingedge number bounded by o(n= log n), and we generalize for graphs of genus bounded by > 0 yielding a size of n log +O(n) bits per node. Actually we prove a sharp upper bound of 2n log k +O(n) for graphs of pagenumber k, and a lower bound of n log
Probabilistic embeddings of bounded genus graphs into planar graphs
 Proc. 23rd Ann. ACM Symp. Comput. Geom
"... Ì��ÓÒ×Ø�ÒØC�×�ÐÐ��Ø����×ØÓÖØ�ÓÒÓ�Ø���Ñ�����Ò � ÄÓÛ��×ØÓÖØ�ÓÒÔÖÓ����Ð�×Ø��Ñ�����Ò�×�Ò��Ð�Ö��Ù�Ò��Ð �ÓÖ�Ø�Ñ�ÔÖÓ�Ð�Ñ×ÓÚ�Ö���Ö���Ù�×ØÑ�ØÖ�×�ÒØÓ���×Ý� i�×ÒÓØ�Ö��Ø�ÖØ��Ò×ÓÑ�ÓÒ×Ø�ÒØCØ�Ñ� × �Ð�××��Ð�Ø�Ö�ÒØ��××�Ø�ÓÒ�ÓÖ��ÓÖÑ�Ð���Ò�Ø�ÓÒ�ÓÖ �Ò�ØÙÖ�Ð��Ò�Ö�Ð�Þ�Ø�ÓÒÓ�ÔÐ�Ò�Ö�ØÝ�Ò��Ó�Ø��Ò��Ù× �Ü�ÑÔÐ��ÔÐ�Ò�Ö�Ö�Ô���×� ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
Ì��ÓÒ×Ø�ÒØC�×�ÐÐ��Ø����×ØÓÖØ�ÓÒÓ�Ø���Ñ�����Ò � ÄÓÛ��×ØÓÖØ�ÓÒÔÖÓ����Ð�×Ø��Ñ�����Ò�×�Ò��Ð�Ö��Ù�Ò��Ð �ÓÖ�Ø�Ñ�ÔÖÓ�Ð�Ñ×ÓÚ�Ö���Ö���Ù�×ØÑ�ØÖ�×�ÒØÓ���×Ý� i�×ÒÓØ�Ö��Ø�ÖØ��Ò×ÓÑ�ÓÒ×Ø�ÒØCØ�Ñ� × �Ð�××��Ð�Ø�Ö�ÒØ��××�Ø�ÓÒ�ÓÖ��ÓÖÑ�Ð���Ò�Ø�ÓÒ�ÓÖ �Ò�ØÙÖ�Ð��Ò�Ö�Ð�Þ�Ø�ÓÒÓ�ÔÐ�Ò�Ö�ØÝ�Ò��Ó�Ø��Ò��Ù× �Ü�ÑÔÐ��ÔÐ�Ò�Ö�Ö�Ô���×��ÒÙ×0�Ò���Ö�Ô�Ø��Ø�Ò �Ò�Ø��ÒÓØ�ÓÒÓ�Ø����ÒÙ×Ó���Ö�Ô�ÁÒ�ÓÖÑ�ÐÐÝ��Ö�Ô � ��×��ÒÙ×g�ÓÖ×ÓÑ�g≥0���Ø�Ò���Ö�ÛÒÛ�Ø�ÓÙØ�ÒÝ ÖÓ××�Ò�×ÓÒØ��×ÙÖ���Ó��×Ô��Ö�Û�Ø�g����Ø�ÓÒ�Ð��Ò �Ó×ØÑ�ØÖ� × ����ÒØÐÝ��Ú�Ò��Ö�Û�Ò�Ó�Ø���Ö�Ô�ÓÒ���ÒÙ×g×ÙÖ ��ÒÙ×�Ò��ÔÖÓ����Ð�×Ø��ÐÐÝ�Ñ�������ÒØÓÔÐ�Ò�Ö�Ö�Ô� × Û�Ø�ÓÒ×Ø�ÒØ��×ØÓÖØ�ÓÒÌ���Ñ�����Ò��Ò��ÓÑÔÙØ� � Ï�×�ÓÛØ��Ø�Ú�ÖÝÑ�ØÖ��Ò�Ù���Ý��Ö�Ô�Ó��ÓÙÒ�� � �ÜÔÖ�××�Ò��ÓÛ��Ö��Ö�Ô��×�ÖÓÑ���Ò�ÔÐ�Ò�ÖÌÓØ��Ø �ÜØ�Ò��Ö�Ô�×Ó�×Ñ�ÐÐ��ÒÙ×Ù×Ù�ÐÐÝ�Ü����ØÒ���Ð�ÓÖ�Ø � Ì����ÒÙ×Ó���Ö�Ô��Ò���ÒØ�ÖÔÖ�Ø���×�ÕÙ�ÒØ�ØÝ Ø��ÓÖ���Ò�Ð��×Ø�Ò��ÓÖC ≥ 1 �� � ÀÓÛ�Ú�Ö×Ù��ÜØ�Ò×�ÓÒ×�Ò�Ò×ÓÑ��×�×��ÓÑÔÐ��Ø� � �×Ñ�ÐÐÐÓ××�Ò����ÒÝÓÖ�ÒØ��ÕÙ�Ð�ØÝÓ�Ø��×ÓÐÙØ�ÓÒ Ñ�ÔÖÓÔ�ÖØ��×Ñ��ÒÐÝ�Ù�ØÓØ���Ö�Ò��Ö�ÒØ×�Ñ�Ð�Ö�Ø��×Û�Ø � ���Ö�ÛÒÓÒ�ØÓÖÙ×��×��ÒÙ×1 �Ò���×��ÓÒ���ÓØ��Ò�ÕÙ� × ÔÐ�Ò�Ö�Ö�Ô�×ÅÓÖ�ÔÖ��×�ÐÝ�Ð�ÓÖ�Ø�Ñ×�ÓÖÔÐ�Ò�Ö�Ö�Ô� × �ÒÙ×Ù�ÐÐÝ���ÜØ�Ò���ØÓ�Ö�Ô�×Ó��ÓÙÒ�����ÒÙ×Û�Ø� �ØÝ℄���Ò�Ö�Ð ���Ò�ÐÝ×�×Ó��Ð�ÓÖ�Ø�Ñ×�Ò�ÈÖÓ�Ð�Ñ�ÓÑÔÐ�Ü Ð�Ñ×ÓÒ�Ö�Ô�×Ó��ÓÙÒ�����ÒÙ×�ÝÖ��Ù�Ò�Ø��ÑØÓÓÖ Ö�×ÔÓÒ��Ò�ÔÖÓ�Ð�Ñ×ÓÒÔÐ�Ò�Ö�Ö�Ô�×ÇÙÖ�ÔÔÖÓ��� × ÁÒØ��×Ô�Ô�ÖÛ���Ú����Ò�Ö�ÐÑ�Ø�Ó��ÓÖ×ÓÐÚ�Ò�ÔÖÓ� �Ð�ÓÖ�Ø�Ñ×Ì��ÓÖÝ Ô����Ö�Ô�H�ÖÓÑFØ��ÒØ���ÜÔ�Ø����×Ø�Ò���ØÛ��Ò �ÓÙÒ�����ÒÙ×Ø��Ö��Ü�×Ø×���×ØÖ��ÙØ�ÓÒFÓÚ�ÖÔÐ�Ò�Ö Ñ�ØÖ�×�ÝØÖ��×��℄Ï�×�ÓÛØ��Ø�ÓÖ�ÒÝ�Ö�Ô�GÓ � �Ò×Ô�Ö���Ý��ÖØ�Ð×ÔÖÓ����Ð�×Ø��ÔÔÖÓÜ�Ñ�Ø�ÓÒÓ���Ò�Ö�Ð (G)��Û� Categories and Subject Descriptors
Isomorphism of Graphs. A Generalization of Bounded Valence and Bounded Genus
"... A polynomial time isomorphism test for graphs called kcontractible graphs for fixed k is included. The class of kcontractible graphs includes the graphs of bounded valence and the graphs of bounded genus. The algorithm several new ideas including: (1) It removes portions of the graph and replaces ..."
Abstract
 Add to MetaCart
A polynomial time isomorphism test for graphs called kcontractible graphs for fixed k is included. The class of kcontractible graphs includes the graphs of bounded valence and the graphs of bounded genus. The algorithm several new ideas including: (1) It removes portions of the graph and replaces
Edge Separators For Graphs Of Bounded Genus With Applications
, 1993
"... We prove that every nvertex graph of genus g and maximal degree k has an edge separator of size O( gkn). The upper bound is best possible to within a constant factor. This extends known results on planar graphs and similar results about vertex separators. We apply the edge separator to the is ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
We prove that every nvertex graph of genus g and maximal degree k has an edge separator of size O( gkn). The upper bound is best possible to within a constant factor. This extends known results on planar graphs and similar results about vertex separators. We apply the edge separator
Results 1  10
of
56,063