Sciweavers

1749 search results - page 203 / 350
» Conditional colorings of graphs
Sort
View
AI
2010
Springer
15 years 6 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
CMOT
2004
141views more  CMOT 2004»
15 years 6 months ago
Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
Garry Robins, Malcolm Alexander
ACSC
2004
IEEE
15 years 10 months ago
Network Robustness and Graph Topology
Two important recent trends in military and civilian communications have been the increasing tendency to base operations around an internal network, and the increasing threats to ...
Anthony H. Dekker, Bernard D. Colbert
ECRTS
2008
IEEE
16 years 1 months ago
Temporal Analysis for Adapting Concurrent Applications to Embedded Systems
Embedded services and applications that interact with the real world often, over time, need to run on different kinds of hardware (low-cost microcontrollers to powerful multicore ...
Sibin Mohan, Johannes Helander
ICDM
2008
IEEE
120views Data Mining» more  ICDM 2008»
16 years 1 months ago
Anti-monotonic Overlap-Graph Support Measures
In graph mining, a frequency measure is anti-monotonic if the frequency of a pattern never exceeds the frequency of a subpattern. The efficiency and correctness of most graph pat...
Toon Calders, Jan Ramon, Dries Van Dyck