Skolemising Blank Nodes while Preserving Isomorphism Aidan Hogan ∗ Department of Computer Science

First Page		Document Content
Date: 2015-03-23 10:08:58 Graph theory Mathematics Discrete mathematics Morphisms Semantic Web Knowledge representation Graph operations Blank node Cograph Graph homomorphism Graph coloring Resource Description Framework		Skolemising Blank Nodes while Preserving Isomorphism Aidan Hogan ∗ Department of Computer Science Add to Reading List Source URL: aidanhogan.com Download Document from Source Website File Size: 416,82 KB Share Document on Facebook

	Finding Four-Node Subgraphs in Triangle Time Virginia Vassilevska Williams∗ Joshua R. Wang† Abstract DocID: 1rg2z - View Document
	Aachen Department of Computer Science Technical Report Better termination proving through cooperation DocID: 1rezO - View Document
	Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set R´emy Belmonte1,? , Pim van ’t Hof1,? , Marcin Kami´ nski2,?? , and Dani¨el Paulusma3,? ? ? 1 DocID: 1qTAq - View Document
	New Results on Maximum Induced Matchings in Bipartite Graphs and Beyond Konrad K. Dabrowskia,b , Marc Demangec,d , Vadim V. Lozina a DIMAP b School DocID: 1qQA2 - View Document
	An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs George B. Mertzios and Walter Unger Department of Computer Science RWTH Aachen, Germany {mertzios, quax}@cs.rwth-aachen.de DocID: 1qMfK - View Document