Sciweavers

191 search results - page 10 / 39
» Intersections of graphs
Sort
View
STOC
2002
ACM
99views Algorithms» more  STOC 2002»
16 years 5 months ago
Recognizing string graphs in NP
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
124
Voted
LICS
2006
IEEE
15 years 11 months ago
On Typability for Rank-2 Intersection Types with Polymorphic Recursion
We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context ...
Tachio Terauchi, Alex Aiken
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
15 years 9 months ago
Linear-Time Recognition of Probe Interval Graphs
The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a varia...
Ross M. McConnell, Yahav Nussbaum
152
Voted
ENDM
2008
90views more  ENDM 2008»
15 years 5 months ago
On cliques of Helly Circular-arc Graphs
A circular-arc graph is the intersection graph of a set of arcs on the circle. It is a Helly circular-arc graph if it has a Helly model, where every maximal clique is the set of a...
Min Chih Lin, Ross M. McConnell, Francisco J. Soul...
ARSCOM
2007
81views more  ARSCOM 2007»
15 years 5 months ago
Graphic Sequences with a Realization Containing a Friendship Graph
For any simple graph H, let σ(H, n) be the minimum m so that for any realizable degree sequence π = (d1, d2, . . . , dn) with sum of degrees at least m, there exists an n-vertex...
Michael Ferrara, Ronald J. Gould, John R. Schmitt