5473 search results - page 83 / 1095 » On the graph isomorphism problem |
SIAMDM
2011
14 years 6 months ago
2011
For stable marriage (SM) and solvable stable roommates (SR) instances, it is known that there are stable matchings that assign each participant to his or her (lower/upper) median ...
101
click to vote
JDA
2010
14 years 6 months ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
STACS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
STACS
2010
Springer
15 years 3 months ago
2010
Springer
We completely characterise the computational complexity of the list homomorphism problem for graphs in combinatorial and algebraic terms: for every graph H the problem is either N...
121
click to vote
ALGORITHMICA
2008
15 years 1 days ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...