Sciweavers

6740 search results - page 229 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
SODA
2010
ACM
248views Algorithms» more  SODA 2010»
15 years 10 months ago
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
Petr Hlineny, Markus Chimani
86
Voted
AIED
2007
Springer
15 years 6 months ago
Taking advantage of the Semantics of a Lesson Graph based on Learning Objects
Lesson graphs are composed of Learning Objects (LOs) and include a valuable amount of information about the content and usage of the LOs, described by the LO metadata. Graphs also ...
Olivier Motelet, Nelson Baloian, Benjamin Piwowars...
IJCNN
2006
IEEE
15 years 6 months ago
Predictive Random Graph Ranking on the Web
Abstract— The incomplete information about the Web structure causes inaccurate results of various ranking algorithms. In this paper, we propose a solution to this problem by form...
Haixuan Yang, Irwin King, Michael R. Lyu
BIRTHDAY
2005
Springer
15 years 2 months ago
From Graph Transformation to Software Engineering and Back
Software engineers usually represent problems and solutions aph-based notations at different levels of abstractions. These notations are often semi-formal, but the use of graph tr...
Luciano Baresi, Mauro Pezzè
MVA
1996
15 years 2 months ago
Recognition of Composite Elements in Bar Graphs
The issue of graph recognition has been not always investigated until today though the subjects on the document image understanding are very interest and have proposed many method...
Naoko Yokokura, Toyohide Watanabe