MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Rearrangeable Graphs." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

15 documents found, showing 1 through 10. Next 10 →

ATOM

Multicast Communication in a Class of Rearrangeable Optical WDM Networks
by Chunling Zhou, Yuanyuan Yang, Charles J. Colbourn — IEEE Trans. Parallel Distrib. Systems
…, rearrangeable, graph-coloring. 1 Introduction Optical networks offer the potential of interconnecting hundreds…
Cited by 1 (1 self) – Add To MetaCart

An Exploration Tool for Formal Proofs
by William M. Farmer, Orlin G. Grigorov
… into rearranging the graph between proof steps, which is possible due to the fact that imps only adds new nodes…
Add To MetaCart

A Graph Model which Supports Flexible Layout Functions
by Wei Lai, Peter Eades — 1996
…ByPushPull (n). They operate on a one-layer inclusion graph G n by performing following two steps: 1. Rearrange…
Cited by 5 (0 self) – Add To MetaCart

Position paper: MetaViz – Issues in Software Visualizing Beyond 3D
by unknown authors
… is that the rearrangement of graphs may not preserve some designing properties, and the context (e.g. grouping, clustering…
Add To MetaCart

New topologies for genetic search space
by Yong-hyuk Kim — 2005 — In Proceedings of the Genetic and Evolutionary Computation Conference
… graph of the given problem instance. Bui and Moon [3] tried gene rearrangement from given graph…
Cited by 2 (1 self) – Add To MetaCart

Using group communication to monitor web-based group learning
by G. D. Chen, C. Y. Wang, K. L. Ou — 2003 — Journal of Computer Assisted Learning
… that generates a group communication graph from the communication log, see below. The teacher first rearranges…
Cited by 3 (0 self) – Add To MetaCart

Graphml transformation
by Ulrik Br, Christian Pich — 2004 — Proceedings of the 11th International Symposium on Graph Drawing (GD ’04), volume 3383 of Lecture Notes in Computer Science
…. This transformation rearranges the graph so that the nodes appear before the edges. All subtrees related to data…
Cited by 1 (1 self) – Add To MetaCart

An Algorithm for Partitioning of Application Specific Systems
by Zebo Peng, Krzysztof Kuchcinski — 1993 — in Proceedings of the European Conference on Design Automation (EDAC
… to specify these two parameters to override the default values. Rearrangements of the graph are done…
Cited by 23 (3 self) – Add To MetaCart

A New Tight Upper Bound on the Transposition Distance
by Anthony Labarre — 2005 — PROCEEDINGS OF THE FIFTH WORKSHOP ON ALGORITHMS IN BIOINFORMATICS (WABI)
… permutation into the identity permutation. In particular, we use the graph of a permutation to compute…
Cited by 2 (1 self) – Add To MetaCart

Aesthetics of Class Diagrams
by Holger Eichelberger — 2002 — In Proceedings of the First IEEE International Workshop on Visualizing Software for Understanding and Analysis
… is not considered in the following steps. 12. Perform subtree crossing optimizations in order to rearrange the graph…
Cited by 11 (3 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB