Sciweavers

1633 search results - page 223 / 327
» Planar Map Graphs
Sort
View
JCT
2008
103views more  JCT 2008»
13 years 10 months ago
A bijective proof of Jackson's formula for the number of factorizations of a cycle
Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n whit...
Gilles Schaeffer, Ekaterina A. Vassilieva
ICSM
2003
IEEE
14 years 3 months ago
Software Architecture Recovery based on Pattern Matching
This paper is a summary of the author’s thesis that presents a model and an environment for recovering the high level design of legacy software systems based on user defined ar...
Kamran Sartipi
INFOVIS
2000
IEEE
14 years 2 months ago
Visualizing Massive Multi-Digraphs
We describe MGV, an integrated visualization and exploration system for massive multi-digraph navigation. MGV’s only assumption is that the vertex set of the underlying digraph ...
James Abello, Jeffrey L. Korn
STOC
1997
ACM
76views Algorithms» more  STOC 1997»
14 years 2 months ago
Exploring Unknown Environments
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connecte...
Susanne Albers, Monika Rauch Henzinger
CODES
2004
IEEE
14 years 2 months ago
Hardware synthesis from coarse-grained dataflow specification for fast HW/SW cosynthesis
This paper concerns automatic hardware synthesis from data flow graph (DFG) specification for fast HW/SW cosynthesis. A node in DFG represents a coarse grain block such as FIR and...
Hyunuk Jung, Soonhoi Ha