Sciweavers

5889 search results - page 148 / 1178
» Graph Layout Problems
Sort
View
ML
2010
ACM
185views Machine Learning» more  ML 2010»
14 years 11 months ago
Learning to rank on graphs
Graph representations of data are increasingly common. Such representations arise in a variety of applications, including computational biology, social network analysis, web applic...
Shivani Agarwal
DAM
1999
128views more  DAM 1999»
15 years 4 months ago
Graph Classes Between Parity and Distance-hereditary Graphs
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
Serafino Cicerone, Gabriele Di Stefano
STOC
2002
ACM
99views Algorithms» more  STOC 2002»
16 years 4 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
ISAAC
2010
Springer
277views Algorithms» more  ISAAC 2010»
15 years 2 months ago
Induced Subgraph Isomorphism on Interval and Proper Interval Graphs
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...
Pinar Heggernes, Daniel Meister, Yngve Villanger
IJFCS
2007
93views more  IJFCS 2007»
15 years 4 months ago
On Computing Longest Paths in Small Graph Classes
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
Ryuhei Uehara, Yushi Uno