{"entities":{"Q6830393":{"pageid":15122245,"ns":120,"title":"Item:Q6830393","lastrevid":56026609,"modified":"2026-02-26T16:44:38Z","type":"item","id":"Q6830393","labels":{"en":{"language":"en","value":"Complexity and algorithms for semipaired domination in graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7173538"}},"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":"Q6830393$251EB987-6744-4BE2-B57A-6E1F451E050D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c7d0291860ce8e6d6eb3c25d2660ef034e6db159","datavalue":{"value":{"text":"Complexity and algorithms for semipaired domination in graphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6830393$D9D8EE3C-0B6A-46B4-9992-815BA8D4F379","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"b0f105331aca687e88e2b1157355a6cc5c8d0f1b","datavalue":{"value":"1503.68222","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6830393$E9A52500-4710-4026-B441-E155AD8A0778","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"59b4b5f79023f48bf778db2cf7aa790a5713e9c9","datavalue":{"value":"10.1007/978-3-030-25005-8_23","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6830393$539BDE5A-5F85-482C-9795-85298ACB4338","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"1ef3efb47b5163e35efff4dde79a3bbdd3dc566b","datavalue":{"value":{"entity-type":"item","numeric-id":186200,"id":"Q186200"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6830393$6525FC44-5ADA-4337-AE1A-3009C9880422","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"51cee9e5b67e7e5abd50010867ed794163d22b7f","datavalue":{"value":{"entity-type":"item","numeric-id":344870,"id":"Q344870"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6830393$D40EA3EB-CFF4-4212-B9A4-FAFA594B47FE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"89673eab76642a2dd3890ceba2016a6723f635a6","datavalue":{"value":{"entity-type":"item","numeric-id":2032282,"id":"Q2032282"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6830393$FC84FFE7-5B9D-4A97-96CB-8BF194AC97E5","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"85c07c7737819bff773f78e2590a3bb761fe677b","datavalue":{"value":{"entity-type":"item","numeric-id":162374,"id":"Q162374"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6830393$9BB17F87-9876-48B6-BA3C-52DE92E14D84","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"e4fc39c5d71734f532829b0132f9f5e75d881f53","datavalue":{"value":{"time":"+2020-02-25T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6830393$08ACC1B1-02A1-448B-953E-32F37CD25C1A","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6830393$EC9AC664-E52D-4C83-AC09-BA0575089FBF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"82e8efd6e51c28a954a2ab0c3ccebf86d2ac5eb3","datavalue":{"value":"05C62","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6830393$7B378A95-553D-4A13-9F96-6860C5C8A885","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"cb1e2924ba238bc47b6e89cc71d65b0484b3d905","datavalue":{"value":"05C69","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6830393$F7F3CFCB-A735-4C5F-B399-5F5B37F4180B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"749b7137f279a66a306e75e15f613231b281c1c5","datavalue":{"value":"05C85","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6830393$48452CD9-28F0-466A-964F-8E8D810D314E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8195a9e26c453276e1d31339bf2413392412013d","datavalue":{"value":"68Q17","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6830393$6416F266-DFAE-4A67-9473-4B5DA74C53B3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a4228d21095b3348e9ea20aa0b63610107aad8cc","datavalue":{"value":"68W25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6830393$F7827624-B503-4610-92E8-D3A6976FA6B5","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"80446260cb0117d5d86684410859c447300bf91e","datavalue":{"value":"7173538","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6830393$3E1394B1-596E-448D-946A-5594EADC2552","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7f607710e1bcd8426818fbf0effed996082aed3f","datavalue":{"value":"domination","type":"string"},"datatype":"string"},"type":"statement","id":"Q6830393$B776611A-A842-4697-8544-7194338AA166","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"cbeecc4657085242645aa8073bd0cdc6646d0b5f","datavalue":{"value":"semipaired domination","type":"string"},"datatype":"string"},"type":"statement","id":"Q6830393$D0A9FBF4-E4C1-418E-AF99-399B4653AFA7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"eecb173004633ca38efc326bcd073800d8b745c9","datavalue":{"value":"bipartite graphs","type":"string"},"datatype":"string"},"type":"statement","id":"Q6830393$5A38F679-8D35-475F-8C75-8049D36970CD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"853bd0b31f9734652041500f2e432a6c8df42e70","datavalue":{"value":"chordal graphs","type":"string"},"datatype":"string"},"type":"statement","id":"Q6830393$95FAF76C-24F3-46E9-9285-80EB27CB9EB3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d59ab2c83e0dbd443ebc1f3d0412b712509c0917","datavalue":{"value":"interval graphs","type":"string"},"datatype":"string"},"type":"statement","id":"Q6830393$BFD74DCA-F8B4-45C0-AD68-2D852DCE47EF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7a38b11968d7cb86be0842b661cd5bdd713115f5","datavalue":{"value":"graph algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q6830393$03280E22-D445-4772-8AC2-2D775CD05F69","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7f5498ca3e7abb035a7212a6e68902ac2f3c0126","datavalue":{"value":"NP-complete","type":"string"},"datatype":"string"},"type":"statement","id":"Q6830393$301821ED-BBE4-4B60-A5D2-80C12B91AA65","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0de600cf8191fa1f423fd01c9a02b172072a7391","datavalue":{"value":"approximation algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q6830393$73456074-2CFC-404E-BE7D-2788EE0B7C85","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":"Q6830393$589AFE2D-320E-45B3-83D7-4D77F9513D60","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Complexity and algorithms for semipaired domination in graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Complexity_and_algorithms_for_semipaired_domination_in_graphs"}}}}}