Sciweavers

1883 search results - page 94 / 377
» Ordered theta graphs
Sort
View
DAM
2006
93views more  DAM 2006»
13 years 7 months ago
Update schedules of sequential dynamical systems
Sequential dynamical systems have the property, that the updates of states of individual cells occur sequentially, so that the global update of the system depends on the order of t...
Reinhard Laubenbacher, Bodo Pareigis
WEA
2007
Springer
112views Algorithms» more  WEA 2007»
14 years 1 months ago
Crossing Minimization in Weighted Bipartite Graphs
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
Olca A. Çakiroglu, Cesim Erten, Ömer K...
EWCBR
2004
Springer
14 years 1 months ago
Investigating Graphs in Textual Case-Based Reasoning
Textual case-based reasoning (TCBR) provides the ability to reason with domain-specific knowledge when experiences exist in text. Ideally, we would like to find an inexpensive way ...
Colleen Cunningham, Rosina Weber, Jason M. Proctor...
RV
2010
Springer
110views Hardware» more  RV 2010»
13 years 6 months ago
Interval Analysis for Concurrent Trace Programs Using Transaction Sequence Graphs
Abstract. Concurrent trace programs (CTPs) are slices of the concurrent programs that generate the concrete program execution traces, where inter-thread event order specific to th...
Malay K. Ganai, Chao Wang
DAM
2011
13 years 2 months ago
Independence in connected graphs
We prove that if G = (VG, EG) is a finite, simple, and undirected graph with κ components and independence number α(G), then there exist a positive integer k ∈ N and a functi...
Jochen Harant, Dieter Rautenbach