Sciweavers

489 search results - page 12 / 98
» Support tools for graphs in computer science
Sort
View
129
Voted
ACSC
2006
IEEE
15 years 10 months ago
Supporting software reuse by the individual programmer
Despite its long history and its benefits, software reuse has yet to become a common practise among software programmers. While there is much ongoing research, it focuses on larg...
Min-Sheng Hsieh, Ewan D. Tempero
138
Voted
GBRPR
2009
Springer
15 years 10 months ago
Computing and Visualizing a Graph-Based Decomposition for Non-manifold Shapes
Modeling and understanding complex non-manifold shapes is a key issue in shape analysis and retrieval. The topological structure of a non-manifold shape can be analyzed through its...
Leila De Floriani, Daniele Panozzo, Annie Hui
MFCS
2004
Springer
15 years 9 months ago
The Bidimensional Theory of Bounded-Genus Graphs
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitr...
SODA
1992
ACM
123views Algorithms» more  SODA 1992»
15 years 5 months ago
Computing Minimal Spanning Subgraphs in Linear Time
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, ...
MFCS
2007
Springer
15 years 10 months ago
Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach
Abstract. We study the existence and tractability of a notion of approximate equilibria in bimatrix games, called well supported approximate Nash Equilibria (SuppNE in short). We p...
Spyros C. Kontogiannis, Paul G. Spirakis