Sciweavers

5889 search results - page 69 / 1178
» Graph Layout Problems
Sort
View
INFOVIS
2003
IEEE
14 years 3 months ago
MoireGraphs: Radial Focus+Context Visualization and Interaction for Graphs with Visual Nodes
Graph and tree visualization techniques enable interactive exploration of complex relations while communicating topology. However, most existing techniques have not been designed ...
T. J. Jankun-Kelly, Kwan-Liu Ma
ISPD
1998
ACM
89views Hardware» more  ISPD 1998»
14 years 2 months ago
Filling and slotting: analysis and algorithms
In very deep-submicron VLSI, certain manufacturing steps – notably optical exposure, resist development and etch, chemical vapor deposition and chemical-mechanical polishing (CM...
Andrew B. Kahng, Gabriel Robins, Anish Singh, Huij...
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 10 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
CSCLP
2007
Springer
14 years 4 months ago
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
Yves Deville, Grégoire Dooms, Stépha...
IPL
2010
115views more  IPL 2010»
13 years 8 months ago
Hardness and approximation of minimum distortion embeddings
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...
Pinar Heggernes, Daniel Meister