Sciweavers

5889 search results - page 348 / 1178
» Graph Layout Problems
Sort
View
FLAIRS
2008
15 years 9 months ago
Graph Grammars: An ITS Technology for Diagram Representations
For many educational applications such as learning tools for argumentation, structured diagrams are a suitable form of external representation. However, student-created graphs pos...
Niels Pinkwart, Kevin D. Ashley, Vincent Aleven, C...
ASPDAC
2005
ACM
99views Hardware» more  ASPDAC 2005»
15 years 8 months ago
Implication of assertion graphs in GSTE
- We address the problem of implication of assertion graphs that occur in generalized symbolic trajectory evaluation (GSTE). GSTE has demonstrated its powerful capacity in formal v...
Guowu Yang, Jin Yang, William N. N. Hung, Xiaoyu S...
IADIS
2004
15 years 8 months ago
Mining Relaxed Graph Properties in Internet
Many real world datasets are represented in the form of graphs. The classical graph properties found in the data, like cliques or independent sets, can reveal new interesting info...
Wilhelmiina Hämäläinen, Hannu Toivo...
DAM
2008
131views more  DAM 2008»
15 years 6 months ago
Partition into cliques for cubic graphs: Planar case, complexity and approximation
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
Márcia R. Cerioli, L. Faria, T. O. Ferreira...
138
Voted
COR
2006
65views more  COR 2006»
15 years 6 months ago
An exact method for graph coloring
We are interested in the graph coloring problem. We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to...
Corinne Lucet, Florence Mendes, Aziz Moukrim