Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2019

2019

Bidimensionality is the most common technique to design subexponential-time parameterized algorithms on special classes of graphs… Expand

Is this relevant?

2016

2016

Map graphs generalize planar graphs and were introduced by Chen, Grigni and Papadimitriou [STOC 1998, J.ACM 2002]. They showed… Expand

Is this relevant?

2015

2015

A map graph is a contact graph of internally-disjoint regions of the plane, where the contact can be even a point. Namely, each… Expand

Is this relevant?

2015

2015

We identify several factors that are critical to high-performance GPU graph analytics: efficient building block operators… Expand

Is this relevant?

2005

2005

Self-Organizing Maps capable of encoding structured information will be used for the clustering of XML documents. Documents… Expand

Is this relevant?

Review

2002

Review

2002

We consider a modified notion of planarity, in which two nations of a map are considered adjacent when they share any point of… Expand

Is this relevant?

2001

2001

Topic Maps and RDF are two independently developed paradigms and standards for the representation, interchange, and exploitation… Expand

Is this relevant?

2000

2000

This paper presents polynomial-time approximation algorithms for the problem of computing a maximum independent set in a given… Expand

Is this relevant?

Highly Cited

1999

Highly Cited

1999

Abstract We introduce a novel view-based object representation, called the saliency map graph (SMG), which captures the salient… Expand

Is this relevant?

1984

1984

Abstract In this paper we provide a characterization of curve map graphs as defined by Gavril and Schonheim, and also give a… Expand

Is this relevant?