{"entities":{"Q1649282":{"pageid":1660023,"ns":120,"title":"Item:Q1649282","lastrevid":68138268,"modified":"2026-04-12T21:41:33Z","type":"item","id":"Q1649282","labels":{"en":{"language":"en","value":"A new heuristic algorithm to solve the maximum independent set problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6898865"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1649282$DD3F4933-D73A-4C71-8C13-B04181F5CD09","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"27070087e6aabc6ec1675eefa7f7bd4b4a92cc38","datavalue":{"value":{"text":"A new heuristic algorithm to solve the maximum independent set problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1649282$ADB9B2DC-165C-4669-86B4-B289E48D1310","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"064ef3c439fcd03a9916e9d347f5074b15d7bd2f","datavalue":{"value":"1390.05179","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1649282$B8B471D1-6AA3-45D4-93F6-8F9F4E27B552","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"a3819ad5437f06e733042977828f1ad0fa881cf4","datavalue":{"value":{"entity-type":"item","numeric-id":1649281,"id":"Q1649281"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1649282$6057AA2D-4E59-4BEC-98AA-AB4A6C41A8AF","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"15f88aa8bef30d5f7d1df3dcbda5f07af4811c8b","datavalue":{"value":{"entity-type":"item","numeric-id":424005,"id":"Q424005"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1649282$A74C79E2-A837-4A5B-867E-2F5C2F5C992A","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"d7081b185219a0a8ed6caf35c1a11b7c947fd5cb","datavalue":{"value":{"time":"+2018-07-05T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1649282$05A93004-5F79-4BF6-B2EB-A1526B9E5899","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"86ac68e0aa0e9f1b74bc742a82c725b98007990b","datavalue":{"value":"Summary: The Maximum Independent Set Problem is a classic graph optimization NPhard problem. Given a graph \\(G=(V,E)\\), the independent set problem is that of finding a maximum-cardinality subset \\(S\\) of \\(V\\) such that no two vertices in \\(S\\) are adjacent. In this paper, the maximum independent set problem is discussed and a new heuristic algorithm is proposed to solve this problem. The performance of the algorithm has been tested on DIMACS benchmark instances and compared with the literature works. The experimental results show that the proposed approach can yield good solutions.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1649282$009CEED8-448B-42D3-BDF5-3FAACA1F11EB","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"cb1e2924ba238bc47b6e89cc71d65b0484b3d905","datavalue":{"value":"05C69","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1649282$23017389-40E3-4BDD-A677-9B06783E6F78","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"749b7137f279a66a306e75e15f613231b281c1c5","datavalue":{"value":"05C85","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1649282$D8FA78B4-47B4-4A42-B423-B9C7A847FCFC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d2d4f4e28fa9ca38421c473fcb6ba728a44de59a","datavalue":{"value":"90C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1649282$134F6C13-AF80-4CCA-B15B-DC104E7559E2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a075736dd24125fb22e78e1f01acbe15d48baf3f","datavalue":{"value":"90C60","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1649282$D170350A-31EB-4F39-BEBC-21E243F233E1","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"e5c886f6678f66d4ec3c7a95a677b7579cbfd23e","datavalue":{"value":"6898865","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1649282$AE1DA032-9428-4918-9B8B-DDB79156C218","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0f0c796fe08d1f3c658a7eb37cd1e46a8dbaf0b5","datavalue":{"value":"maximum independent set problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q1649282$FD96C73A-C881-428D-BD34-83DD2645CAFB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2635dcacba143f1ee2396e49b5f6dbf507364ce4","datavalue":{"value":"heuristics algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q1649282$AFA8D67F-CEBF-4274-B501-8D2A073B0029","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c27024bc3112e6fbf1cca0a9a4aacb8e7e4a77e0","datavalue":{"value":"optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q1649282$17BF072E-AA0E-4DF5-A033-A27CA830E30E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"99974e488eefe65e9a359b970a995a9b6d33d8e8","datavalue":{"value":"NP-hard problems","type":"string"},"datatype":"string"},"type":"statement","id":"Q1649282$5B3D3615-ADEB-4EEA-9A9C-9DA16288E060","rank":"normal"}],"P1463":[{"mainsnak":{"snaktype":"value","property":"P1463","hash":"2a216d6c09dac0df49b00b19ed2bb5c4336ef7f4","datavalue":{"value":{"entity-type":"item","numeric-id":20231,"id":"Q20231"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1649282$2B70BEC8-DADD-4269-9CFE-912D1ACCFB23","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1649282$E9265D0F-C963-4403-9BB9-59F1166A404E","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"1997221bec43acc452acaf8f8366d5b83654bd8f","datavalue":{"value":"https://doi.org/10.3390/mca18030495","type":"string"},"datatype":"url"},"type":"statement","id":"Q1649282$F4E083E0-C4C8-404D-BE2C-BB9BF4937B39","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"2a40d7f52b5b8aed4f40b6b426166e83ec16e949","datavalue":{"value":"W2296404885","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1649282$B7C21894-7262-444E-8B2D-314BD87EBC3F","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"9961f5a66022cc0eaff5c6b4a4e16fd8289c7371","datavalue":{"value":"10.3390/MCA18030495","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1649282$7C30D846-4C17-449E-99E8-3D5D1DCFEE67","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"bb6453fe8bc82e99f546f5e74ac26771a70b0047","datavalue":{"value":{"entity-type":"item","numeric-id":2792975,"id":"Q2792975"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"e02bb02b5f8733b29e698617eb2ed1e323a35414","datavalue":{"value":{"amount":"+0.8705968856811523","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1649282$0B52E1DF-BDB0-4A1B-BBB6-EF437D0E683F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"44ea5aaea7112a2db76a57d8c95cb8797fd59233","datavalue":{"value":{"entity-type":"item","numeric-id":1610661,"id":"Q1610661"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"ad6d261cd1ff5c4cedd87a7f1a0a5eabd4d30df9","datavalue":{"value":{"amount":"+0.8433564901351929","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1649282$BB656C5A-D517-4348-A617-50EC0894F8A5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"52a86a29cee50fca0646d209709ce0df155fa09d","datavalue":{"value":{"entity-type":"item","numeric-id":1749784,"id":"Q1749784"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"c37c394586fe19ce6526d823dcf7c888f8f4f81d","datavalue":{"value":{"amount":"+0.8323618769645691","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1649282$5F47A5E9-EEAA-4E2F-A3AB-4D40CD015D02","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"e7c2311d22e5b35230eb0488e6c1e1f6ab89910f","datavalue":{"value":{"entity-type":"item","numeric-id":2452735,"id":"Q2452735"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"dd3c5cfb7eaf04820a194bd58ccaed80637dabff","datavalue":{"value":{"amount":"+0.8289797902107239","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1649282$5F9B9E76-C349-45A5-A68B-EBE439AAC89F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"7a8930f0db0c20c7d0258f0fba65ae44a7dafd0d","datavalue":{"value":{"entity-type":"item","numeric-id":2870792,"id":"Q2870792"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"23cf0aa504fa417184a754afbdfad447ad67e846","datavalue":{"value":{"amount":"+0.8176329731941223","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1649282$72C49813-BB29-4053-86C0-0D6256F285F6","rank":"normal"}],"P163":[{"mainsnak":{"snaktype":"value","property":"P163","hash":"45fcd4163b5f33e6e8c784f5522d7246c0a1a61e","datavalue":{"value":{"entity-type":"item","numeric-id":57056,"id":"Q57056"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1649282$922005D6-57E1-474A-ADAB-4533482ADD98","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A new heuristic algorithm to solve the maximum independent set problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_new_heuristic_algorithm_to_solve_the_maximum_independent_set_problem"}}}}}