9532 search results - page 60 / 1907 » Logic, Graphs, and Algorithms |
78
Voted
CORR
2009
Springer
15 years 1 months ago
2009
Springer
140
click to vote
SWAT
1994
Springer
15 years 8 months ago
1994
Springer
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k-trees and k-connected partial k-trees these include subgraph isomorphism a...
139
click to vote
DAM
2008
15 years 4 months ago
2008
This paper presents algorithms to find vertex-critical and edgecritical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the ch...
144
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...