820 search results - page 13 / 164 » Inducing Temporal Graphs |
DM
2010
13 years 8 months ago
2010
For a graph G, denote by fk(G) the smallest number of vertices that must be deleted from G so that the remaining induced subgraph has its maximum degree shared by at least k verti...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
We study the complexity of rewrite systems shown terminating via the dependency pair framework using processors for reduction pairs, dependency graphs, or the subterm criterion. T...
FSTTCS
2006
Springer
14 years 2 days ago
2006
Springer
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
WG
2007
Springer
14 years 2 months ago
2007
Springer
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...
IJCNN
2000
IEEE
14 years 24 days ago
2000
IEEE
This paper examines the computational role of inhibition as it moves towards balancing concurrent excitation using the biologically-inspired Temporal Noisy-Leaky Integrator (TNLI) ...