diff --git a/README.md b/README.md
index 8c5d72c..adc203d 100644
--- a/README.md
+++ b/README.md
@@ -1,17 +1,17 @@
-# Introduction #
+## Introduction
 
 **AMC** implements an Ant-based algorithm to find a maximum clique from a given graph. It can be used with a compiler (e.g. GCC or Intel Compiler suite) that supports OpenMP for parallelism.
 
-## Requires ##
+## Requires
 * C++ Compiler
 
-## Compile and Run ###
+## Compile and Run
 ```
 $ cd src
 $ make
 
 # run the program ../examples/brock200_1.clq.b with seed 1
-$ ./maxclique  ../examples/brock200_1.clq.b 1
+$ ./amc  ../examples/brock200_1.clq.b 1
 nthreads: 1 cliq_siz: 19 vertices: 200 edges: 14834 clique: (58,7,102,57,31,143,121,61,126,103,187,21,56,37,45,9,124,106,42) seed: 1
 ```
 
diff --git a/src/Makefile b/src/Makefile
index a5a5adf..ab6c625 100644
--- a/src/Makefile
+++ b/src/Makefile
@@ -1,5 +1,5 @@
 maxclique: maxclique.cc Dimacs.h maxclique.h  MT_rand.h  settings.h
-	g++  -std=c++11 -o maxclique maxclique.cc
+	g++  -std=c++11 -o amc maxclique.cc
 
 clean:
-	rm maxclique
+	rm amc