5100 search results - page 78 / 1020 » The Linear Complexity of a Graph |
CPM
1994
Springer
14 years 1 days ago
1994
Springer
Recently, a new compact representation for suboptimal alignments was proposed by Naor and Brutlag (1993). The kernel of that representation is a minimal directed acyclic graph (DAG...
CAAN
2004
Springer
14 years 1 months ago
2004
Springer
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...
IPL
2008
13 years 8 months ago
2008
Colouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which descisions are made locally with no information about the graph�...
COMSIS
2010
13 years 5 months ago
2010
Multi-video summarization is a great theoretical and technical challenge due to the wider diversity of topics in multi-video than singlevideo as well as the multi-modality nature o...
EURODAC
1994
IEEE
14 years 2 days ago
1994
IEEE
This paper introduces a new Generalized Signal Transition Graph model for specifying complex mixed asynchronous/synchronouscircuits, as found in system-level interfaces. Our goal h...