2365 search results - page 122 / 473 » All things are connected |
109
click to vote
COMBINATORICS
2007
15 years 1 months ago
2007
A simple 2-matching in a graph is a subgraph all of whose nodes have degree 1 or 2. A simple 2-matching is called k-restricted if every connected component has > k edges. We co...
CORR
2007
Springer
15 years 1 months ago
2007
Springer
We propose a special computational device which uses light rays for solving the subset-sum problem. The device has a graph-like representation and the light is traversing it by fol...
112
click to vote
DAM
2007
15 years 1 months ago
2007
In this paper, we prove that the harmonious coloring problem is NP-complete for connected interval and permutation graphs. Given a simple graph G, a harmonious coloring of G is a ...
114
click to vote
KES
2008
Springer
15 years 1 months ago
2008
Springer
One of the main problems facing the development of ontology-aware authoring systems (OAS) is to link well-designed domain-independent knowledge (ontologies) with domain content. Su...
109
click to vote
TCS
2008
15 years 1 months ago
2008
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...