cleanup

changelog.md

@@ -6,6 +6,9 @@ and adheres to [Semantic Versioning](http://semver.org/spec/v2.0.0.html).
 
 ## 0.0.2 
 ### Added 
+- Interval balancing which transforms the interval splitting problem 
+into one of removing intervals which are closed, an easier and more 
+efficient problem to solve. This improves the performance of `mieda`.
 - Code that allows intervals in isolation to be added to the directed graph. 
 - A parameter that allows the graph object (a NetworkX directed graph) 
 to be returned from `Merge.union` instead of a list of intervals (thanks 

readme.md

@@ -26,7 +26,7 @@ pip install mieda # or pip3 install ... if you're using both Python 3 and 2.
 
 To merge intervals containing sets, pass a list of dictionaries as shown 
 in the below example:
-3
+
 ```python
 import datetime
 from mieda.intervals import Merge
@@ -89,7 +89,6 @@ print(Merge.union(intervals=intervals, return_graph=True))
 ```
 
 
-
 ## Scalability 
 
 MIEDA is pretty scalable: 
@@ -119,23 +118,4 @@ Setting up a virtual environment for testing and development is recommended.
 ## Other Things to Know
 
 ### License
-This project is licensed under the Apache 2.0 license.
-
-### Research
-If citing `mieda` in your research, please consider using the following entry: 
-
-```
-@article{ConstantinouMishraStonebrakerHoffmann2020,
-  doi = {},
-  url = {},
-  year  = {},
-  month = {},
-  publisher = {},
-  volume = {},
-  number = {},
-  pages = {},
-  author = {Valentino Constantinou, Asitang Mishra, Ryan Stonebraker, Mark Hoffmann},
-  title = {},
-  journal = {}
-}
-```
+This project is licensed under the Apache 2.0 license.

setup.py

@@ -4,7 +4,7 @@
     name='mieda',
     packages=['mieda'],
     version='0.0.2',
-    description='',
+    description='Merging of set-containing Intervals Efficiently with a Directed-graph Algorithm',
     author='Valentino Constantinou',
     author_email='vconstan@jpl.caltech.edu',
     url='https://github.com/vc1492a/mieda',