Sciweavers

1633 search results - page 109 / 327
» Planar Map Graphs
Sort
View
ICALP
2009
Springer
16 years 3 months ago
Elimination Graphs
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
Yuli Ye, Allan Borodin
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
15 years 5 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
150
Voted
IV
2009
IEEE
128views Visualization» more  IV 2009»
15 years 10 months ago
Large Quasi-Tree Drawing: A Neighborhood Based Approach
In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects ha...
Romain Bourqui, David Auber
GC
2006
Springer
15 years 3 months ago
The Semi-Arc Automorphism Group of a Graph with Application to Map Enumeration
A map is a connected topological graph cellularly embedded in a surface. For a given graph , its genus distribution of rooted maps and embeddings on orientable and non-orientable s...
Linfan Mao, Yanpei Liu, Erling Wei
ISNN
2005
Springer
15 years 8 months ago
Advanced Visualization Techniques for Self-organizing Maps with Graph-Based Methods
The Self-Organizing Map is a popular neural network model for data analysis, for which a wide variety of visualization techniques exists. We present a novel technique that takes th...
Georg Pölzlbauer, Andreas Rauber, Michael Dit...